./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 12:53:13,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 12:53:13,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 12:53:13,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 12:53:13,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 12:53:13,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 12:53:13,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 12:53:13,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 12:53:13,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 12:53:13,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 12:53:13,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 12:53:13,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 12:53:13,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 12:53:13,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 12:53:13,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 12:53:13,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 12:53:13,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 12:53:13,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 12:53:13,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 12:53:13,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 12:53:13,310 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 12:53:13,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 12:53:13,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 12:53:13,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 12:53:13,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 12:53:13,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 12:53:13,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 12:53:13,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 12:53:13,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 12:53:13,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 12:53:13,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 12:53:13,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 12:53:13,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 12:53:13,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 12:53:13,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 12:53:13,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 12:53:13,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 12:53:13,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 12:53:13,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 12:53:13,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 12:53:13,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 12:53:13,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 12:53:13,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 12:53:13,352 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 12:53:13,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 12:53:13,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 12:53:13,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 12:53:13,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 12:53:13,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 12:53:13,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 12:53:13,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 12:53:13,359 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 12:53:13,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 12:53:13,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 12:53:13,360 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 12:53:13,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 12:53:13,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 12:53:13,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 12:53:13,360 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 12:53:13,360 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 12:53:13,360 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 12:53:13,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 12:53:13,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 12:53:13,362 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 12:53:13,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 12:53:13,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 12:53:13,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 12:53:13,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 12:53:13,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:53:13,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 12:53:13,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 12:53:13,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 12:53:13,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 12:53:13,363 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 -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2022-07-14 12:53:13,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 12:53:13,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 12:53:13,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 12:53:13,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 12:53:13,587 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 12:53:13,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2022-07-14 12:53:13,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/297982566/a04b4bbb692c40e0bb0c4cda73090f43/FLAGbffb6da74 [2022-07-14 12:53:14,124 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 12:53:14,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2022-07-14 12:53:14,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/297982566/a04b4bbb692c40e0bb0c4cda73090f43/FLAGbffb6da74 [2022-07-14 12:53:14,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/297982566/a04b4bbb692c40e0bb0c4cda73090f43 [2022-07-14 12:53:14,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 12:53:14,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 12:53:14,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 12:53:14,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 12:53:14,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 12:53:14,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:53:14" (1/1) ... [2022-07-14 12:53:14,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb6ca82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:14, skipping insertion in model container [2022-07-14 12:53:14,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:53:14" (1/1) ... [2022-07-14 12:53:14,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 12:53:14,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:53:14,825 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_BER_test4-3.i[33021,33034] [2022-07-14 12:53:14,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:53:14,943 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-14 12:53:14,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@59af31f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:14, skipping insertion in model container [2022-07-14 12:53:14,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 12:53:14,945 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 12:53:14,946 INFO L158 Benchmark]: Toolchain (without parser) took 476.00ms. Allocated memory is still 107.0MB. Free memory was 70.4MB in the beginning and 70.1MB in the end (delta: 288.8kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 12:53:14,946 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 78.1MB in the beginning and 78.1MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 12:53:14,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.25ms. Allocated memory is still 107.0MB. Free memory was 70.1MB in the beginning and 70.7MB in the end (delta: -597.2kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 12:53:14,948 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.14ms. Allocated memory is still 107.0MB. Free memory was 78.1MB in the beginning and 78.1MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.25ms. Allocated memory is still 107.0MB. Free memory was 70.1MB in the beginning and 70.7MB in the end (delta: -597.2kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 12:53:16,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 12:53:16,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 12:53:16,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 12:53:16,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 12:53:16,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 12:53:16,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 12:53:16,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 12:53:16,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 12:53:16,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 12:53:16,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 12:53:16,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 12:53:16,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 12:53:16,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 12:53:16,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 12:53:16,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 12:53:16,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 12:53:16,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 12:53:16,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 12:53:16,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 12:53:16,540 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 12:53:16,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 12:53:16,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 12:53:16,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 12:53:16,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 12:53:16,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 12:53:16,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 12:53:16,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 12:53:16,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 12:53:16,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 12:53:16,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 12:53:16,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 12:53:16,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 12:53:16,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 12:53:16,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 12:53:16,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 12:53:16,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 12:53:16,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 12:53:16,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 12:53:16,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 12:53:16,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 12:53:16,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 12:53:16,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 12:53:16,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 12:53:16,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 12:53:16,599 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 12:53:16,599 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 12:53:16,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 12:53:16,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 12:53:16,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 12:53:16,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 12:53:16,601 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 12:53:16,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 12:53:16,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 12:53:16,602 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 12:53:16,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 12:53:16,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 12:53:16,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 12:53:16,603 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 12:53:16,603 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 12:53:16,603 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 12:53:16,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 12:53:16,604 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 12:53:16,604 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 12:53:16,604 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 12:53:16,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 12:53:16,604 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 12:53:16,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 12:53:16,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 12:53:16,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 12:53:16,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:53:16,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 12:53:16,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 12:53:16,606 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 12:53:16,606 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 12:53:16,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 12:53:16,606 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 -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2022-07-14 12:53:16,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 12:53:16,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 12:53:16,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 12:53:16,891 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 12:53:16,891 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 12:53:16,893 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2022-07-14 12:53:16,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4949b64cd/31d53d6806bc4898ba2da29685930ef6/FLAG86faac32b [2022-07-14 12:53:17,365 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 12:53:17,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2022-07-14 12:53:17,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4949b64cd/31d53d6806bc4898ba2da29685930ef6/FLAG86faac32b [2022-07-14 12:53:17,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4949b64cd/31d53d6806bc4898ba2da29685930ef6 [2022-07-14 12:53:17,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 12:53:17,734 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 12:53:17,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 12:53:17,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 12:53:17,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 12:53:17,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:53:17" (1/1) ... [2022-07-14 12:53:17,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208e1b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:17, skipping insertion in model container [2022-07-14 12:53:17,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:53:17" (1/1) ... [2022-07-14 12:53:17,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 12:53:17,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:53:18,060 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_BER_test4-3.i[33021,33034] [2022-07-14 12:53:18,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:53:18,220 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 12:53:18,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:53:18,253 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_BER_test4-3.i[33021,33034] [2022-07-14 12:53:18,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:53:18,309 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 12:53:18,321 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_BER_test4-3.i[33021,33034] [2022-07-14 12:53:18,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:53:18,390 INFO L208 MainTranslator]: Completed translation [2022-07-14 12:53:18,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18 WrapperNode [2022-07-14 12:53:18,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 12:53:18,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 12:53:18,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 12:53:18,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 12:53:18,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (1/1) ... [2022-07-14 12:53:18,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (1/1) ... [2022-07-14 12:53:18,501 INFO L137 Inliner]: procedures = 180, calls = 448, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1473 [2022-07-14 12:53:18,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 12:53:18,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 12:53:18,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 12:53:18,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 12:53:18,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (1/1) ... [2022-07-14 12:53:18,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (1/1) ... [2022-07-14 12:53:18,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (1/1) ... [2022-07-14 12:53:18,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (1/1) ... [2022-07-14 12:53:18,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (1/1) ... [2022-07-14 12:53:18,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (1/1) ... [2022-07-14 12:53:18,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (1/1) ... [2022-07-14 12:53:18,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 12:53:18,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 12:53:18,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 12:53:18,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 12:53:18,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (1/1) ... [2022-07-14 12:53:18,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:53:18,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 12:53:18,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 12:53:18,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 12:53:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-14 12:53:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 12:53:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-14 12:53:18,682 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-14 12:53:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 12:53:18,682 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 12:53:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 12:53:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 12:53:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 12:53:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 12:53:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 12:53:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 12:53:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 12:53:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 12:53:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 12:53:18,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 12:53:18,908 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 12:53:18,909 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 12:53:18,912 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 12:53:23,260 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 12:53:23,282 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 12:53:23,283 INFO L299 CfgBuilder]: Removed 77 assume(true) statements. [2022-07-14 12:53:23,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:53:23 BoogieIcfgContainer [2022-07-14 12:53:23,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 12:53:23,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 12:53:23,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 12:53:23,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 12:53:23,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:53:17" (1/3) ... [2022-07-14 12:53:23,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c246e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:53:23, skipping insertion in model container [2022-07-14 12:53:23,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:53:18" (2/3) ... [2022-07-14 12:53:23,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c246e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:53:23, skipping insertion in model container [2022-07-14 12:53:23,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:53:23" (3/3) ... [2022-07-14 12:53:23,302 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-3.i [2022-07-14 12:53:23,312 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 12:53:23,312 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 851 error locations. [2022-07-14 12:53:23,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 12:53:23,394 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@3484e341, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@376a7348 [2022-07-14 12:53:23,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 851 error locations. [2022-07-14 12:53:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 1651 states, 787 states have (on average 2.283354510800508) internal successors, (1797), 1642 states have internal predecessors, (1797), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 12:53:23,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:23,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 12:53:23,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:23,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:23,413 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-14 12:53:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:23,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671557898] [2022-07-14 12:53:23,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:23,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:23,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:23,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:23,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 12:53:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:23,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-14 12:53:23,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:23,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:23,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:23,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671557898] [2022-07-14 12:53:23,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671557898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:23,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:23,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:53:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509832767] [2022-07-14 12:53:23,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:23,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 12:53:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:23,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 12:53:23,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 12:53:23,671 INFO L87 Difference]: Start difference. First operand has 1651 states, 787 states have (on average 2.283354510800508) internal successors, (1797), 1642 states have internal predecessors, (1797), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:23,757 INFO L93 Difference]: Finished difference Result 1633 states and 1726 transitions. [2022-07-14 12:53:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 12:53:23,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 12:53:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:23,779 INFO L225 Difference]: With dead ends: 1633 [2022-07-14 12:53:23,779 INFO L226 Difference]: Without dead ends: 1631 [2022-07-14 12:53:23,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 12:53:23,786 INFO L413 NwaCegarLoop]: 1726 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:23,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-07-14 12:53:23,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-07-14 12:53:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 778 states have (on average 2.1748071979434447) internal successors, (1692), 1622 states have internal predecessors, (1692), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:23,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 1724 transitions. [2022-07-14 12:53:23,905 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 1724 transitions. Word has length 5 [2022-07-14 12:53:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:23,905 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 1724 transitions. [2022-07-14 12:53:23,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1724 transitions. [2022-07-14 12:53:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 12:53:23,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:23,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 12:53:23,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-14 12:53:24,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:24,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-14 12:53:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:24,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138326652] [2022-07-14 12:53:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:24,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:24,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:24,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 12:53:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:24,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:53:24,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:24,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:24,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:24,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:24,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138326652] [2022-07-14 12:53:24,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138326652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:24,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:24,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:53:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662320047] [2022-07-14 12:53:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:24,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:53:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:53:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:24,311 INFO L87 Difference]: Start difference. First operand 1631 states and 1724 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:26,405 INFO L93 Difference]: Finished difference Result 1668 states and 1774 transitions. [2022-07-14 12:53:26,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:53:26,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 12:53:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:26,410 INFO L225 Difference]: With dead ends: 1668 [2022-07-14 12:53:26,410 INFO L226 Difference]: Without dead ends: 1668 [2022-07-14 12:53:26,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:26,412 INFO L413 NwaCegarLoop]: 996 mSDtfsCounter, 1159 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:26,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1291 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-14 12:53:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2022-07-14 12:53:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1614. [2022-07-14 12:53:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 854 states have (on average 2.030444964871194) internal successors, (1734), 1605 states have internal predecessors, (1734), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1766 transitions. [2022-07-14 12:53:26,437 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1766 transitions. Word has length 5 [2022-07-14 12:53:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:26,437 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 1766 transitions. [2022-07-14 12:53:26,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1766 transitions. [2022-07-14 12:53:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 12:53:26,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:26,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 12:53:26,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:26,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:26,646 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:26,647 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-14 12:53:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:26,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445320903] [2022-07-14 12:53:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:26,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:26,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:26,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 12:53:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:26,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:53:26,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:26,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:26,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:26,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:26,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445320903] [2022-07-14 12:53:26,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445320903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:26,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:26,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:53:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676977354] [2022-07-14 12:53:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:26,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:53:26,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:26,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:53:26,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:26,802 INFO L87 Difference]: Start difference. First operand 1614 states and 1766 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:29,549 INFO L93 Difference]: Finished difference Result 1917 states and 2089 transitions. [2022-07-14 12:53:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:53:29,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 12:53:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:29,554 INFO L225 Difference]: With dead ends: 1917 [2022-07-14 12:53:29,554 INFO L226 Difference]: Without dead ends: 1917 [2022-07-14 12:53:29,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:29,556 INFO L413 NwaCegarLoop]: 1392 mSDtfsCounter, 504 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:29,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2076 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-14 12:53:29,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2022-07-14 12:53:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1770. [2022-07-14 12:53:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1020 states have (on average 2.0) internal successors, (2040), 1761 states have internal predecessors, (2040), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2072 transitions. [2022-07-14 12:53:29,579 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2072 transitions. Word has length 5 [2022-07-14 12:53:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:29,580 INFO L495 AbstractCegarLoop]: Abstraction has 1770 states and 2072 transitions. [2022-07-14 12:53:29,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2072 transitions. [2022-07-14 12:53:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 12:53:29,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:29,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 12:53:29,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:29,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:29,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-14 12:53:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:29,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339958177] [2022-07-14 12:53:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:29,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:29,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:29,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:29,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 12:53:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:29,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 12:53:29,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:29,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-14 12:53:29,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:29,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:29,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339958177] [2022-07-14 12:53:29,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339958177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:29,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:29,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738567269] [2022-07-14 12:53:29,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:29,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:53:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:29,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:53:29,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:29,914 INFO L87 Difference]: Start difference. First operand 1770 states and 2072 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:30,008 INFO L93 Difference]: Finished difference Result 3114 states and 3679 transitions. [2022-07-14 12:53:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:53:30,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 12:53:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:30,023 INFO L225 Difference]: With dead ends: 3114 [2022-07-14 12:53:30,024 INFO L226 Difference]: Without dead ends: 3114 [2022-07-14 12:53:30,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:30,025 INFO L413 NwaCegarLoop]: 1900 mSDtfsCounter, 1143 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:30,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 3516 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 12:53:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2022-07-14 12:53:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 1771. [2022-07-14 12:53:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1021 states have (on average 1.999020568070519) internal successors, (2041), 1762 states have internal predecessors, (2041), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2073 transitions. [2022-07-14 12:53:30,064 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2073 transitions. Word has length 6 [2022-07-14 12:53:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:30,066 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2073 transitions. [2022-07-14 12:53:30,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2073 transitions. [2022-07-14 12:53:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 12:53:30,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:30,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:30,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:30,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:30,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-14 12:53:30,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:30,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482081631] [2022-07-14 12:53:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:30,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:30,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:30,282 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:30,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 12:53:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:30,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 12:53:30,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:30,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:30,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:30,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482081631] [2022-07-14 12:53:30,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482081631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:30,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:30,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364163428] [2022-07-14 12:53:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:30,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:53:30,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:30,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:53:30,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:30,437 INFO L87 Difference]: Start difference. First operand 1771 states and 2073 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:30,463 INFO L93 Difference]: Finished difference Result 1735 states and 2036 transitions. [2022-07-14 12:53:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:53:30,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 12:53:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:30,468 INFO L225 Difference]: With dead ends: 1735 [2022-07-14 12:53:30,468 INFO L226 Difference]: Without dead ends: 1735 [2022-07-14 12:53:30,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:30,469 INFO L413 NwaCegarLoop]: 1573 mSDtfsCounter, 1533 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:30,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1606 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-14 12:53:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1729. [2022-07-14 12:53:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1003 states have (on average 1.992023928215354) internal successors, (1998), 1720 states have internal predecessors, (1998), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2030 transitions. [2022-07-14 12:53:30,491 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2030 transitions. Word has length 11 [2022-07-14 12:53:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:30,491 INFO L495 AbstractCegarLoop]: Abstraction has 1729 states and 2030 transitions. [2022-07-14 12:53:30,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2030 transitions. [2022-07-14 12:53:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 12:53:30,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:30,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:30,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:30,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:30,700 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-14 12:53:30,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:30,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486248740] [2022-07-14 12:53:30,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:30,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:30,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:30,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:30,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 12:53:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:30,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:53:30,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:30,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:30,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:30,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486248740] [2022-07-14 12:53:30,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486248740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:30,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:30,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:53:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554882335] [2022-07-14 12:53:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:30,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:30,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:30,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:30,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:30,873 INFO L87 Difference]: Start difference. First operand 1729 states and 2030 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:30,944 INFO L93 Difference]: Finished difference Result 1714 states and 2008 transitions. [2022-07-14 12:53:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:53:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 12:53:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:30,952 INFO L225 Difference]: With dead ends: 1714 [2022-07-14 12:53:30,952 INFO L226 Difference]: Without dead ends: 1714 [2022-07-14 12:53:30,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:53:30,954 INFO L413 NwaCegarLoop]: 1528 mSDtfsCounter, 1504 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:30,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 3082 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-07-14 12:53:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1707. [2022-07-14 12:53:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 995 states have (on average 1.9788944723618092) internal successors, (1969), 1698 states have internal predecessors, (1969), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2001 transitions. [2022-07-14 12:53:30,975 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2001 transitions. Word has length 13 [2022-07-14 12:53:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:30,975 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2001 transitions. [2022-07-14 12:53:30,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2001 transitions. [2022-07-14 12:53:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 12:53:30,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:30,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:30,986 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-14 12:53:31,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:31,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-14 12:53:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:31,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558840390] [2022-07-14 12:53:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:31,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:31,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:31,188 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:31,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 12:53:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:31,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:53:31,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:31,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:31,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:31,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:31,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558840390] [2022-07-14 12:53:31,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558840390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:31,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:31,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:31,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599046208] [2022-07-14 12:53:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:31,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:31,410 INFO L87 Difference]: Start difference. First operand 1707 states and 2001 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:34,386 INFO L93 Difference]: Finished difference Result 2520 states and 2820 transitions. [2022-07-14 12:53:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:53:34,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 12:53:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:34,393 INFO L225 Difference]: With dead ends: 2520 [2022-07-14 12:53:34,394 INFO L226 Difference]: Without dead ends: 2520 [2022-07-14 12:53:34,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:53:34,394 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 2761 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2774 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:34,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2774 Valid, 1876 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-14 12:53:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2022-07-14 12:53:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1703. [2022-07-14 12:53:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 995 states have (on average 1.9748743718592965) internal successors, (1965), 1694 states have internal predecessors, (1965), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 1997 transitions. [2022-07-14 12:53:34,421 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 1997 transitions. Word has length 27 [2022-07-14 12:53:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:34,422 INFO L495 AbstractCegarLoop]: Abstraction has 1703 states and 1997 transitions. [2022-07-14 12:53:34,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 1997 transitions. [2022-07-14 12:53:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 12:53:34,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:34,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:34,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-14 12:53:34,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:34,631 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:34,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:34,631 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-14 12:53:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:34,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068246220] [2022-07-14 12:53:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:34,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:34,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:34,633 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:34,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 12:53:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:34,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 12:53:34,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:34,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:34,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:34,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068246220] [2022-07-14 12:53:34,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068246220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:34,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:34,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698131380] [2022-07-14 12:53:34,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:34,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:34,904 INFO L87 Difference]: Start difference. First operand 1703 states and 1997 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:38,659 INFO L93 Difference]: Finished difference Result 2264 states and 2467 transitions. [2022-07-14 12:53:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:53:38,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 12:53:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:38,665 INFO L225 Difference]: With dead ends: 2264 [2022-07-14 12:53:38,665 INFO L226 Difference]: Without dead ends: 2264 [2022-07-14 12:53:38,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:53:38,666 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 1247 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:38,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2536 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-14 12:53:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-07-14 12:53:38,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1699. [2022-07-14 12:53:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 995 states have (on average 1.9708542713567838) internal successors, (1961), 1690 states have internal predecessors, (1961), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 1993 transitions. [2022-07-14 12:53:38,695 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 1993 transitions. Word has length 27 [2022-07-14 12:53:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:38,696 INFO L495 AbstractCegarLoop]: Abstraction has 1699 states and 1993 transitions. [2022-07-14 12:53:38,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 1993 transitions. [2022-07-14 12:53:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 12:53:38,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:38,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:38,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:38,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:38,906 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-14 12:53:38,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:38,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128585811] [2022-07-14 12:53:38,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:38,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:38,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:38,908 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:38,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 12:53:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:39,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:53:39,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:39,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:39,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:39,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128585811] [2022-07-14 12:53:39,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128585811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:39,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:39,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:53:39,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689919496] [2022-07-14 12:53:39,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:39,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:39,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:39,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:39,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:39,121 INFO L87 Difference]: Start difference. First operand 1699 states and 1993 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:39,196 INFO L93 Difference]: Finished difference Result 1699 states and 1989 transitions. [2022-07-14 12:53:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:53:39,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-14 12:53:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:39,201 INFO L225 Difference]: With dead ends: 1699 [2022-07-14 12:53:39,201 INFO L226 Difference]: Without dead ends: 1699 [2022-07-14 12:53:39,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:53:39,204 INFO L413 NwaCegarLoop]: 1522 mSDtfsCounter, 1480 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:39,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 3060 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-07-14 12:53:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1693. [2022-07-14 12:53:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 989 states have (on average 1.9726996966632964) internal successors, (1951), 1684 states have internal predecessors, (1951), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 1983 transitions. [2022-07-14 12:53:39,226 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 1983 transitions. Word has length 42 [2022-07-14 12:53:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:39,228 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 1983 transitions. [2022-07-14 12:53:39,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1983 transitions. [2022-07-14 12:53:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 12:53:39,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:39,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:39,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:39,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:39,443 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:39,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:39,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-14 12:53:39,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:39,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845400668] [2022-07-14 12:53:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:39,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:39,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:39,460 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:39,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 12:53:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:39,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:53:39,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:39,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:39,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:39,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845400668] [2022-07-14 12:53:39,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845400668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:39,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:39,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927906148] [2022-07-14 12:53:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:39,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:53:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:39,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:53:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:39,794 INFO L87 Difference]: Start difference. First operand 1693 states and 1983 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:39,947 INFO L93 Difference]: Finished difference Result 2112 states and 2419 transitions. [2022-07-14 12:53:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:53:39,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-14 12:53:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:39,954 INFO L225 Difference]: With dead ends: 2112 [2022-07-14 12:53:39,954 INFO L226 Difference]: Without dead ends: 2112 [2022-07-14 12:53:39,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:39,955 INFO L413 NwaCegarLoop]: 1600 mSDtfsCounter, 455 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:39,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2996 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 12:53:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2022-07-14 12:53:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1739. [2022-07-14 12:53:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1035 states have (on average 1.9294685990338165) internal successors, (1997), 1730 states have internal predecessors, (1997), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2029 transitions. [2022-07-14 12:53:39,980 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2029 transitions. Word has length 50 [2022-07-14 12:53:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:39,981 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 2029 transitions. [2022-07-14 12:53:39,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2029 transitions. [2022-07-14 12:53:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 12:53:39,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:39,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:39,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:40,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:40,193 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:40,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-14 12:53:40,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:40,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312671078] [2022-07-14 12:53:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:40,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:40,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:40,196 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:40,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 12:53:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:40,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 12:53:40,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:40,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:40,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:40,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 12:53:40,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 12:53:40,779 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:53:40,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 12:53:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:40,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:40,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:40,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312671078] [2022-07-14 12:53:40,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312671078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:40,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:40,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:40,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821034211] [2022-07-14 12:53:40,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:40,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:40,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:40,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:40,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:40,791 INFO L87 Difference]: Start difference. First operand 1739 states and 2029 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:43,105 INFO L93 Difference]: Finished difference Result 1708 states and 1952 transitions. [2022-07-14 12:53:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:53:43,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-14 12:53:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:43,110 INFO L225 Difference]: With dead ends: 1708 [2022-07-14 12:53:43,110 INFO L226 Difference]: Without dead ends: 1708 [2022-07-14 12:53:43,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:43,110 INFO L413 NwaCegarLoop]: 748 mSDtfsCounter, 1095 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:43,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 1218 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-14 12:53:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2022-07-14 12:53:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1489. [2022-07-14 12:53:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 869 states have (on average 1.8365937859608745) internal successors, (1596), 1480 states have internal predecessors, (1596), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1628 transitions. [2022-07-14 12:53:43,150 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1628 transitions. Word has length 53 [2022-07-14 12:53:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:43,151 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1628 transitions. [2022-07-14 12:53:43,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1628 transitions. [2022-07-14 12:53:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 12:53:43,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:43,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:43,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-14 12:53:43,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:43,361 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-14 12:53:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:43,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966474303] [2022-07-14 12:53:43,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:43,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:43,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:43,381 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:43,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 12:53:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:43,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 12:53:43,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:43,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:43,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:53:43,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 12:53:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:43,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:43,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:43,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966474303] [2022-07-14 12:53:43,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966474303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:43,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:43,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:53:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687090781] [2022-07-14 12:53:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:43,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:53:43,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:43,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:53:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:53:43,666 INFO L87 Difference]: Start difference. First operand 1489 states and 1628 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:45,931 INFO L93 Difference]: Finished difference Result 1488 states and 1627 transitions. [2022-07-14 12:53:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:53:45,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-14 12:53:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:45,939 INFO L225 Difference]: With dead ends: 1488 [2022-07-14 12:53:45,939 INFO L226 Difference]: Without dead ends: 1488 [2022-07-14 12:53:45,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:53:45,940 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 4 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:45,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3630 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 12:53:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-07-14 12:53:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2022-07-14 12:53:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 869 states have (on average 1.8354430379746836) internal successors, (1595), 1479 states have internal predecessors, (1595), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1627 transitions. [2022-07-14 12:53:45,954 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1627 transitions. Word has length 58 [2022-07-14 12:53:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:45,955 INFO L495 AbstractCegarLoop]: Abstraction has 1488 states and 1627 transitions. [2022-07-14 12:53:45,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1627 transitions. [2022-07-14 12:53:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 12:53:45,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:45,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:45,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:46,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:46,166 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:46,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:46,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-14 12:53:46,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:46,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766551225] [2022-07-14 12:53:46,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:46,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:46,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:46,169 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:46,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 12:53:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:46,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 12:53:46,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:46,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:46,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:53:46,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:53:46,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 12:53:46,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 12:53:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:46,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:46,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:46,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766551225] [2022-07-14 12:53:46,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766551225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:46,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:46,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:53:46,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056950268] [2022-07-14 12:53:46,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:46,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:53:46,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:46,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:53:46,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:53:46,534 INFO L87 Difference]: Start difference. First operand 1488 states and 1627 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:49,877 INFO L93 Difference]: Finished difference Result 1487 states and 1626 transitions. [2022-07-14 12:53:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:53:49,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-14 12:53:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:49,880 INFO L225 Difference]: With dead ends: 1487 [2022-07-14 12:53:49,880 INFO L226 Difference]: Without dead ends: 1487 [2022-07-14 12:53:49,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:53:49,883 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 2 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3681 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:49,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3681 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-14 12:53:49,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2022-07-14 12:53:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1487. [2022-07-14 12:53:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 868 states have (on average 1.836405529953917) internal successors, (1594), 1478 states have internal predecessors, (1594), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1626 transitions. [2022-07-14 12:53:49,898 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1626 transitions. Word has length 58 [2022-07-14 12:53:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:49,898 INFO L495 AbstractCegarLoop]: Abstraction has 1487 states and 1626 transitions. [2022-07-14 12:53:49,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1626 transitions. [2022-07-14 12:53:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 12:53:49,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:49,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:49,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:50,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:50,111 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:50,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1222950270, now seen corresponding path program 1 times [2022-07-14 12:53:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:50,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297479840] [2022-07-14 12:53:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:50,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:50,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:50,114 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:50,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 12:53:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:50,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:53:50,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:50,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:50,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:50,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297479840] [2022-07-14 12:53:50,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297479840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:50,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:50,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:53:50,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062027003] [2022-07-14 12:53:50,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:50,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:50,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:50,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:50,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:50,360 INFO L87 Difference]: Start difference. First operand 1487 states and 1626 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 12:53:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:50,420 INFO L93 Difference]: Finished difference Result 1490 states and 1631 transitions. [2022-07-14 12:53:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:53:50,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-07-14 12:53:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:50,427 INFO L225 Difference]: With dead ends: 1490 [2022-07-14 12:53:50,427 INFO L226 Difference]: Without dead ends: 1490 [2022-07-14 12:53:50,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:53:50,428 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 2 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4315 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:50,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4315 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-07-14 12:53:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2022-07-14 12:53:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 870 states have (on average 1.835632183908046) internal successors, (1597), 1481 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 12:53:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1631 transitions. [2022-07-14 12:53:50,449 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1631 transitions. Word has length 66 [2022-07-14 12:53:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:50,450 INFO L495 AbstractCegarLoop]: Abstraction has 1490 states and 1631 transitions. [2022-07-14 12:53:50,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 12:53:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1631 transitions. [2022-07-14 12:53:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 12:53:50,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:50,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:50,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:50,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:50,660 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -428715873, now seen corresponding path program 1 times [2022-07-14 12:53:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:50,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445940008] [2022-07-14 12:53:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:50,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:50,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:50,662 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:50,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 12:53:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:50,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:53:50,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:50,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:51,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:51,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445940008] [2022-07-14 12:53:51,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445940008] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:53:51,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:53:51,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-14 12:53:51,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146349242] [2022-07-14 12:53:51,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:53:51,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 12:53:51,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:51,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 12:53:51,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 12:53:51,021 INFO L87 Difference]: Start difference. First operand 1490 states and 1631 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:51,234 INFO L93 Difference]: Finished difference Result 1502 states and 1649 transitions. [2022-07-14 12:53:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 12:53:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-14 12:53:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:51,237 INFO L225 Difference]: With dead ends: 1502 [2022-07-14 12:53:51,237 INFO L226 Difference]: Without dead ends: 1502 [2022-07-14 12:53:51,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-14 12:53:51,238 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 15 mSDsluCounter, 5737 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:51,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7178 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 12:53:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-07-14 12:53:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1500. [2022-07-14 12:53:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 879 states have (on average 1.8339021615472126) internal successors, (1612), 1490 states have internal predecessors, (1612), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 12:53:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1646 transitions. [2022-07-14 12:53:51,253 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1646 transitions. Word has length 67 [2022-07-14 12:53:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:51,254 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 1646 transitions. [2022-07-14 12:53:51,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1646 transitions. [2022-07-14 12:53:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 12:53:51,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:51,255 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:51,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:51,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:51,464 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash 155254206, now seen corresponding path program 2 times [2022-07-14 12:53:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:51,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619150731] [2022-07-14 12:53:51,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 12:53:51,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:51,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:51,467 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:51,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 12:53:51,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 12:53:51,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:53:51,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 12:53:51,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:51,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:52,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:52,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619150731] [2022-07-14 12:53:52,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619150731] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:53:52,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:53:52,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-14 12:53:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418625134] [2022-07-14 12:53:52,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:53:52,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 12:53:52,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:52,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 12:53:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 12:53:52,014 INFO L87 Difference]: Start difference. First operand 1500 states and 1646 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:52,533 INFO L93 Difference]: Finished difference Result 1521 states and 1678 transitions. [2022-07-14 12:53:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 12:53:52,534 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-14 12:53:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:52,537 INFO L225 Difference]: With dead ends: 1521 [2022-07-14 12:53:52,537 INFO L226 Difference]: Without dead ends: 1517 [2022-07-14 12:53:52,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-14 12:53:52,538 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 44 mSDsluCounter, 11498 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 12942 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:52,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 12942 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 12:53:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2022-07-14 12:53:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1509. [2022-07-14 12:53:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 888 states have (on average 1.8288288288288288) internal successors, (1624), 1499 states have internal predecessors, (1624), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 12:53:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1658 transitions. [2022-07-14 12:53:52,553 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1658 transitions. Word has length 70 [2022-07-14 12:53:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:52,554 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 1658 transitions. [2022-07-14 12:53:52,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1658 transitions. [2022-07-14 12:53:52,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 12:53:52,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:52,554 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:52,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:52,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:52,765 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:52,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash -392207842, now seen corresponding path program 3 times [2022-07-14 12:53:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:52,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363563990] [2022-07-14 12:53:52,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 12:53:52,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:52,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:52,768 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:52,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 12:53:53,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-14 12:53:53,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:53:53,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 12:53:53,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:53,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:54,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:54,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363563990] [2022-07-14 12:53:54,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363563990] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:53:54,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:53:54,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-14 12:53:54,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748946419] [2022-07-14 12:53:54,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:53:54,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 12:53:54,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 12:53:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-14 12:53:54,033 INFO L87 Difference]: Start difference. First operand 1509 states and 1658 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:56,722 INFO L93 Difference]: Finished difference Result 1551 states and 1734 transitions. [2022-07-14 12:53:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 12:53:56,723 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-14 12:53:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:56,725 INFO L225 Difference]: With dead ends: 1551 [2022-07-14 12:53:56,725 INFO L226 Difference]: Without dead ends: 1545 [2022-07-14 12:53:56,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 12:53:56,726 INFO L413 NwaCegarLoop]: 1448 mSDtfsCounter, 162 mSDsluCounter, 15872 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 17320 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:56,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 17320 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 12:53:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2022-07-14 12:53:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1527. [2022-07-14 12:53:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 906 states have (on average 1.8178807947019868) internal successors, (1647), 1517 states have internal predecessors, (1647), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 12:53:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1681 transitions. [2022-07-14 12:53:56,750 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1681 transitions. Word has length 76 [2022-07-14 12:53:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:56,751 INFO L495 AbstractCegarLoop]: Abstraction has 1527 states and 1681 transitions. [2022-07-14 12:53:56,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1681 transitions. [2022-07-14 12:53:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 12:53:56,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:56,752 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:56,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:56,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:53:56,964 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:53:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1896075998, now seen corresponding path program 4 times [2022-07-14 12:53:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:56,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219473164] [2022-07-14 12:53:56,965 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 12:53:56,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:56,966 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:56,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 12:53:57,247 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 12:53:57,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:53:57,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 12:53:57,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:57,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:58,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:58,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219473164] [2022-07-14 12:53:58,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219473164] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:53:58,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:53:58,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-14 12:53:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306962076] [2022-07-14 12:53:58,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:53:58,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 12:53:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 12:53:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-14 12:53:58,765 INFO L87 Difference]: Start difference. First operand 1527 states and 1681 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:54:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:54:08,618 INFO L93 Difference]: Finished difference Result 1607 states and 1814 transitions. [2022-07-14 12:54:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-14 12:54:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-14 12:54:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:54:08,621 INFO L225 Difference]: With dead ends: 1607 [2022-07-14 12:54:08,621 INFO L226 Difference]: Without dead ends: 1603 [2022-07-14 12:54:08,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-14 12:54:08,625 INFO L413 NwaCegarLoop]: 1461 mSDtfsCounter, 416 mSDsluCounter, 34926 mSDsCounter, 0 mSdLazyCounter, 3066 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 36387 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 3066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-14 12:54:08,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 36387 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 3066 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-14 12:54:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2022-07-14 12:54:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1561. [2022-07-14 12:54:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 940 states have (on average 1.8010638297872341) internal successors, (1693), 1551 states have internal predecessors, (1693), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 12:54:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1727 transitions. [2022-07-14 12:54:08,652 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1727 transitions. Word has length 88 [2022-07-14 12:54:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:54:08,652 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1727 transitions. [2022-07-14 12:54:08,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:54:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1727 transitions. [2022-07-14 12:54:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 12:54:08,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:54:08,653 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:54:08,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 12:54:08,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:54:08,879 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:54:08,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:54:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash 202285118, now seen corresponding path program 5 times [2022-07-14 12:54:08,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:54:08,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259958263] [2022-07-14 12:54:08,880 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 12:54:08,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:54:08,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:54:08,892 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:54:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 12:54:10,242 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 12:54:10,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:54:10,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 12:54:10,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:54:10,313 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 12:54:10,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-14 12:54:10,531 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 12:54:10,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-14 12:54:10,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:54:10,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2022-07-14 12:54:14,457 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1588)))) is different from true [2022-07-14 12:54:16,630 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:54:16,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2022-07-14 12:54:16,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2022-07-14 12:54:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-07-14 12:54:16,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:54:17,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:54:17,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259958263] [2022-07-14 12:54:17,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259958263] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:54:17,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [193304052] [2022-07-14 12:54:17,169 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 12:54:17,169 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 12:54:17,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 12:54:17,171 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 12:54:17,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-14 12:55:40,258 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 12:55:40,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:55:40,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 12:55:40,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:55:40,503 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 12:55:40,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-14 12:55:40,697 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 12:55:40,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 41 [2022-07-14 12:55:40,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:55:40,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-14 12:55:43,022 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:55:43,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-14 12:55:43,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-07-14 12:55:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-14 12:55:43,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:55:43,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [193304052] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:55:43,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:55:43,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2022-07-14 12:55:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290960361] [2022-07-14 12:55:43,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:55:43,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 12:55:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:55:43,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 12:55:43,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=333, Unknown=27, NotChecked=38, Total=462 [2022-07-14 12:55:43,312 INFO L87 Difference]: Start difference. First operand 1561 states and 1727 transitions. Second operand has 19 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 12:55:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:55:46,814 INFO L93 Difference]: Finished difference Result 1628 states and 1797 transitions. [2022-07-14 12:55:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 12:55:46,814 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-07-14 12:55:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:55:46,817 INFO L225 Difference]: With dead ends: 1628 [2022-07-14 12:55:46,817 INFO L226 Difference]: Without dead ends: 1624 [2022-07-14 12:55:46,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 117 SyntacticMatches, 91 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=143, Invalid=630, Unknown=43, NotChecked=54, Total=870 [2022-07-14 12:55:46,818 INFO L413 NwaCegarLoop]: 1422 mSDtfsCounter, 75 mSDsluCounter, 7976 mSDsCounter, 0 mSdLazyCounter, 2899 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 9398 SdHoareTripleChecker+Invalid, 8862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5958 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:55:46,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 9398 Invalid, 8862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2899 Invalid, 0 Unknown, 5958 Unchecked, 3.1s Time] [2022-07-14 12:55:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-07-14 12:55:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1622. [2022-07-14 12:55:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 999 states have (on average 1.7557557557557557) internal successors, (1754), 1610 states have internal predecessors, (1754), 17 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (19), 8 states have call predecessors, (19), 17 states have call successors, (19) [2022-07-14 12:55:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1790 transitions. [2022-07-14 12:55:46,843 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1790 transitions. Word has length 110 [2022-07-14 12:55:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:55:46,844 INFO L495 AbstractCegarLoop]: Abstraction has 1622 states and 1790 transitions. [2022-07-14 12:55:46,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 12:55:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1790 transitions. [2022-07-14 12:55:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 12:55:46,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:55:46,846 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:55:46,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-14 12:55:47,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-14 12:55:47,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 12:55:47,272 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 12:55:47,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:55:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash 202285119, now seen corresponding path program 1 times [2022-07-14 12:55:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:55:47,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509414315] [2022-07-14 12:55:47,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:55:47,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:55:47,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:55:47,275 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:55:47,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 12:55:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:55:48,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-14 12:55:48,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:55:48,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:55:48,167 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:55:48,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 12:55:48,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:55:48,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:55:48,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:55:48,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-14 12:55:48,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 12:55:48,323 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458)))) is different from true [2022-07-14 12:55:48,331 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:55:48,338 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,345 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-07-14 12:55:48,368 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:48,375 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471)))) is different from true [2022-07-14 12:55:48,382 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473)))) is different from true [2022-07-14 12:55:48,389 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,396 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477)))) is different from true [2022-07-14 12:55:48,403 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479)))) is different from true [2022-07-14 12:55:48,410 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,417 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,441 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,448 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:48,455 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,462 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:48,468 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,476 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:55:48,483 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,490 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-07-14 12:55:48,496 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-14 12:55:48,503 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:48,510 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:55:48,517 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:48,524 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-07-14 12:55:48,531 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-07-14 12:55:48,538 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:48,545 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,552 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-07-14 12:55:48,559 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-07-14 12:55:48,566 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:48,573 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:55:48,580 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-07-14 12:55:48,587 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:55:48,595 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530)))) is different from true [2022-07-14 12:55:48,601 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,608 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-07-14 12:55:48,615 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2022-07-14 12:55:48,623 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:48,631 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:48,638 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:48,663 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:55:48,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 12:55:48,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 12:55:48,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 12:55:48,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 12:55:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-07-14 12:55:48,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:55:49,365 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2022-07-14 12:55:49,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:55:49,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509414315] [2022-07-14 12:55:49,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509414315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:55:49,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [212512767] [2022-07-14 12:55:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:55:49,386 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 12:55:49,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 12:55:49,387 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 12:55:49,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process