./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:35:45,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:35:45,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:35:45,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:35:45,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:35:45,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:35:45,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:35:45,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:35:45,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:35:45,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:35:45,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:35:45,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:35:45,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:35:45,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:35:45,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:35:45,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:35:45,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:35:45,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:35:45,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:35:45,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:35:45,524 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:35:45,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:35:45,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:35:45,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:35:45,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:35:45,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:35:45,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:35:45,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:35:45,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:35:45,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:35:45,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:35:45,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:35:45,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:35:45,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:35:45,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:35:45,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:35:45,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:35:45,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:35:45,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:35:45,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:35:45,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:35:45,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:35:45,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 12:35:45,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:35:45,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:35:45,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:35:45,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:35:45,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:35:45,579 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:35:45,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:35:45,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:35:45,580 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:35:45,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:35:45,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:35:45,582 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:35:45,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:35:45,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:35:45,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:35:45,582 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:35:45,583 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:35:45,583 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:35:45,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:35:45,584 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:35:45,584 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:35:45,584 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:35:45,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:35:45,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:35:45,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:35:45,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:35:45,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:35:45,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:35:45,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 12:35:45,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 12:35:45,586 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2022-07-23 12:35:45,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:35:45,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:35:45,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:35:45,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:35:45,888 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:35:45,889 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_test9-2.i [2022-07-23 12:35:45,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c83c7c4/f1dbf36966c9433d82974aa1c8569fbe/FLAG21cd9bcf5 [2022-07-23 12:35:46,531 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:35:46,532 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2022-07-23 12:35:46,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c83c7c4/f1dbf36966c9433d82974aa1c8569fbe/FLAG21cd9bcf5 [2022-07-23 12:35:46,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c83c7c4/f1dbf36966c9433d82974aa1c8569fbe [2022-07-23 12:35:46,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:35:46,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:35:46,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:35:46,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:35:46,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:35:46,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:35:46" (1/1) ... [2022-07-23 12:35:46,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cda340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:46, skipping insertion in model container [2022-07-23 12:35:46,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:35:46" (1/1) ... [2022-07-23 12:35:46,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:35:46,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:35:47,231 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_test9-2.i[33021,33034] [2022-07-23 12:35:47,417 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_test9-2.i[84583,84596] [2022-07-23 12:35:47,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:35:47,443 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-23 12:35:47,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6de0a84e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:47, skipping insertion in model container [2022-07-23 12:35:47,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:35:47,444 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 12:35:47,446 INFO L158 Benchmark]: Toolchain (without parser) took 688.38ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 71.1MB in the beginning and 87.6MB in the end (delta: -16.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-23 12:35:47,446 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 12:35:47,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 685.06ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 70.8MB in the beginning and 87.6MB in the end (delta: -16.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-23 12:35:47,453 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 685.06ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 70.8MB in the beginning and 87.6MB in the end (delta: -16.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:35:49,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:35:49,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:35:49,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:35:49,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:35:49,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:35:49,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:35:49,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:35:49,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:35:49,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:35:49,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:35:49,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:35:49,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:35:49,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:35:49,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:35:49,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:35:49,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:35:49,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:35:49,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:35:49,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:35:49,327 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:35:49,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:35:49,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:35:49,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:35:49,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:35:49,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:35:49,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:35:49,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:35:49,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:35:49,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:35:49,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:35:49,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:35:49,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:35:49,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:35:49,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:35:49,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:35:49,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:35:49,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:35:49,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:35:49,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:35:49,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:35:49,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:35:49,357 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 12:35:49,388 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:35:49,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:35:49,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:35:49,389 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:35:49,390 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:35:49,390 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:35:49,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:35:49,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:35:49,391 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:35:49,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:35:49,392 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:35:49,393 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:35:49,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:35:49,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:35:49,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:35:49,403 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:35:49,403 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:35:49,403 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:35:49,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:35:49,404 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:35:49,404 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 12:35:49,404 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 12:35:49,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:35:49,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:35:49,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:35:49,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:35:49,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:35:49,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:35:49,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:35:49,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:35:49,406 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 12:35:49,406 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 12:35:49,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 12:35:49,407 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2022-07-23 12:35:49,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:35:49,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:35:49,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:35:49,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:35:49,742 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:35:49,743 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_test9-2.i [2022-07-23 12:35:49,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adfb02dc5/103309f847634da5afed8bce0e295423/FLAG20cc9feb7 [2022-07-23 12:35:50,485 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:35:50,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2022-07-23 12:35:50,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adfb02dc5/103309f847634da5afed8bce0e295423/FLAG20cc9feb7 [2022-07-23 12:35:50,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adfb02dc5/103309f847634da5afed8bce0e295423 [2022-07-23 12:35:50,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:35:50,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:35:50,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:35:50,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:35:50,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:35:50,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:35:50" (1/1) ... [2022-07-23 12:35:50,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a2f8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:50, skipping insertion in model container [2022-07-23 12:35:50,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:35:50" (1/1) ... [2022-07-23 12:35:50,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:35:50,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:35:51,406 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_test9-2.i[33021,33034] [2022-07-23 12:35:51,681 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_test9-2.i[84583,84596] [2022-07-23 12:35:51,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:35:51,699 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 12:35:51,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:35:51,724 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_test9-2.i[33021,33034] [2022-07-23 12:35:51,800 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_test9-2.i[84583,84596] [2022-07-23 12:35:51,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:35:51,811 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 12:35:51,850 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_test9-2.i[33021,33034] [2022-07-23 12:35:51,910 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_test9-2.i[84583,84596] [2022-07-23 12:35:51,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:35:51,957 INFO L208 MainTranslator]: Completed translation [2022-07-23 12:35:51,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51 WrapperNode [2022-07-23 12:35:51,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:35:51,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 12:35:51,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 12:35:51,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 12:35:51,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (1/1) ... [2022-07-23 12:35:52,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (1/1) ... [2022-07-23 12:35:52,112 INFO L137 Inliner]: procedures = 180, calls = 781, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3034 [2022-07-23 12:35:52,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 12:35:52,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 12:35:52,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 12:35:52,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 12:35:52,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (1/1) ... [2022-07-23 12:35:52,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (1/1) ... [2022-07-23 12:35:52,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (1/1) ... [2022-07-23 12:35:52,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (1/1) ... [2022-07-23 12:35:52,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (1/1) ... [2022-07-23 12:35:52,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (1/1) ... [2022-07-23 12:35:52,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (1/1) ... [2022-07-23 12:35:52,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 12:35:52,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 12:35:52,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 12:35:52,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 12:35:52,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (1/1) ... [2022-07-23 12:35:52,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:35:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 12:35:52,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 12:35:52,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 12:35:52,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-23 12:35:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 12:35:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 12:35:52,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 12:35:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 12:35:52,366 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 12:35:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 12:35:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 12:35:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 12:35:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 12:35:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-23 12:35:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 12:35:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 12:35:52,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 12:35:52,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 12:35:52,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 12:35:52,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 12:35:52,669 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 12:35:52,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 12:35:52,675 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 12:35:57,591 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 12:35:57,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 12:35:57,634 INFO L299 CfgBuilder]: Removed 63 assume(true) statements. [2022-07-23 12:35:57,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:35:57 BoogieIcfgContainer [2022-07-23 12:35:57,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 12:35:57,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 12:35:57,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 12:35:57,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 12:35:57,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:35:50" (1/3) ... [2022-07-23 12:35:57,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0b715c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:35:57, skipping insertion in model container [2022-07-23 12:35:57,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:35:51" (2/3) ... [2022-07-23 12:35:57,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0b715c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:35:57, skipping insertion in model container [2022-07-23 12:35:57,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:35:57" (3/3) ... [2022-07-23 12:35:57,649 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-2.i [2022-07-23 12:35:57,662 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 12:35:57,663 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 536 error locations. [2022-07-23 12:35:57,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 12:35:57,751 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@3889d1a9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2048ff00 [2022-07-23 12:35:57,751 INFO L358 AbstractCegarLoop]: Starting to check reachability of 536 error locations. [2022-07-23 12:35:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 2071 states, 1032 states have (on average 2.123062015503876) internal successors, (2191), 2065 states have internal predecessors, (2191), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-07-23 12:35:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 12:35:57,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:35:57,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 12:35:57,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:35:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:35:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2022-07-23 12:35:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:35:57,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668955037] [2022-07-23 12:35:57,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:35:57,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:35:57,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:35:57,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:35:57,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-23 12:35:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:35:57,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:35:57,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:35:58,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:35:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:35:58,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:35:58,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:35:58,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668955037] [2022-07-23 12:35:58,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668955037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:35:58,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:35:58,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:35:58,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551964991] [2022-07-23 12:35:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:35:58,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:35:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:35:58,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:35:58,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:35:58,077 INFO L87 Difference]: Start difference. First operand has 2071 states, 1032 states have (on average 2.123062015503876) internal successors, (2191), 2065 states have internal predecessors, (2191), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:00,557 INFO L93 Difference]: Finished difference Result 2235 states and 3301 transitions. [2022-07-23 12:36:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:36:00,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 12:36:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:00,593 INFO L225 Difference]: With dead ends: 2235 [2022-07-23 12:36:00,594 INFO L226 Difference]: Without dead ends: 2233 [2022-07-23 12:36:00,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:00,598 INFO L413 NwaCegarLoop]: 2636 mSDtfsCounter, 1985 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2488 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:00,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2488 Valid, 2785 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-23 12:36:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2022-07-23 12:36:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2055. [2022-07-23 12:36:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1032 states have (on average 2.0416666666666665) internal successors, (2107), 2049 states have internal predecessors, (2107), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-07-23 12:36:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3113 transitions. [2022-07-23 12:36:00,928 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3113 transitions. Word has length 3 [2022-07-23 12:36:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:00,928 INFO L495 AbstractCegarLoop]: Abstraction has 2055 states and 3113 transitions. [2022-07-23 12:36:00,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3113 transitions. [2022-07-23 12:36:00,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 12:36:00,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:00,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 12:36:00,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:01,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:01,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2022-07-23 12:36:01,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:01,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889400811] [2022-07-23 12:36:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:01,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:01,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:01,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:01,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-23 12:36:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:01,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:36:01,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:01,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:01,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:01,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:01,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889400811] [2022-07-23 12:36:01,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889400811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:01,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:01,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:36:01,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932492974] [2022-07-23 12:36:01,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:01,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:36:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:01,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:36:01,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:01,274 INFO L87 Difference]: Start difference. First operand 2055 states and 3113 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:04,425 INFO L93 Difference]: Finished difference Result 3463 states and 5553 transitions. [2022-07-23 12:36:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:36:04,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 12:36:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:04,445 INFO L225 Difference]: With dead ends: 3463 [2022-07-23 12:36:04,445 INFO L226 Difference]: Without dead ends: 3463 [2022-07-23 12:36:04,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:04,446 INFO L413 NwaCegarLoop]: 3417 mSDtfsCounter, 1440 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:04,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 5500 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 12:36:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2022-07-23 12:36:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3177. [2022-07-23 12:36:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 1655 states have (on average 2.015105740181269) internal successors, (3335), 3171 states have internal predecessors, (3335), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 5341 transitions. [2022-07-23 12:36:04,768 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 5341 transitions. Word has length 3 [2022-07-23 12:36:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:04,768 INFO L495 AbstractCegarLoop]: Abstraction has 3177 states and 5341 transitions. [2022-07-23 12:36:04,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 5341 transitions. [2022-07-23 12:36:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 12:36:04,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:04,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:04,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:04,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:04,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:04,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2022-07-23 12:36:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:04,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429487432] [2022-07-23 12:36:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:04,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:04,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:04,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:04,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-23 12:36:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:05,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 12:36:05,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:05,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:05,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:05,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:36:05,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 12:36:05,210 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:36:05,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-23 12:36:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:05,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:05,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:05,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429487432] [2022-07-23 12:36:05,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429487432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:05,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:05,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:36:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458688975] [2022-07-23 12:36:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:05,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:36:05,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:05,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:36:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:36:05,234 INFO L87 Difference]: Start difference. First operand 3177 states and 5341 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:09,200 INFO L93 Difference]: Finished difference Result 3344 states and 5516 transitions. [2022-07-23 12:36:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:36:09,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-23 12:36:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:09,219 INFO L225 Difference]: With dead ends: 3344 [2022-07-23 12:36:09,219 INFO L226 Difference]: Without dead ends: 3344 [2022-07-23 12:36:09,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:36:09,220 INFO L413 NwaCegarLoop]: 2363 mSDtfsCounter, 4223 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4726 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:09,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4726 Valid, 2444 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-23 12:36:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2022-07-23 12:36:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 2044. [2022-07-23 12:36:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1032 states have (on average 2.0300387596899223) internal successors, (2095), 2038 states have internal predecessors, (2095), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-07-23 12:36:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3101 transitions. [2022-07-23 12:36:09,474 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3101 transitions. Word has length 7 [2022-07-23 12:36:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:09,475 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 3101 transitions. [2022-07-23 12:36:09,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3101 transitions. [2022-07-23 12:36:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 12:36:09,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:09,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:09,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:09,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:09,678 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2022-07-23 12:36:09,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:09,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892493584] [2022-07-23 12:36:09,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:09,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:09,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:09,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-23 12:36:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:09,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:36:09,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:09,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:09,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:09,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:09,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892493584] [2022-07-23 12:36:09,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892493584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:09,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:09,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:36:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816705009] [2022-07-23 12:36:09,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:09,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:36:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:36:09,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:09,824 INFO L87 Difference]: Start difference. First operand 2044 states and 3101 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:11,800 INFO L93 Difference]: Finished difference Result 3210 states and 5288 transitions. [2022-07-23 12:36:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:36:11,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-23 12:36:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:11,819 INFO L225 Difference]: With dead ends: 3210 [2022-07-23 12:36:11,819 INFO L226 Difference]: Without dead ends: 3210 [2022-07-23 12:36:11,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:11,821 INFO L413 NwaCegarLoop]: 4866 mSDtfsCounter, 1804 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 7123 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:11,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2307 Valid, 7123 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-23 12:36:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2022-07-23 12:36:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 1997. [2022-07-23 12:36:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1032 states have (on average 1.9844961240310077) internal successors, (2048), 1991 states have internal predecessors, (2048), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-07-23 12:36:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 3054 transitions. [2022-07-23 12:36:12,086 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 3054 transitions. Word has length 8 [2022-07-23 12:36:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:12,087 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 3054 transitions. [2022-07-23 12:36:12,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 3054 transitions. [2022-07-23 12:36:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 12:36:12,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:12,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:12,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:12,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:12,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2022-07-23 12:36:12,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:12,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930150475] [2022-07-23 12:36:12,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:12,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:12,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:12,301 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:12,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-23 12:36:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:12,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:36:12,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:12,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:12,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:12,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:12,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930150475] [2022-07-23 12:36:12,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930150475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:12,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:12,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:36:12,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758729100] [2022-07-23 12:36:12,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:12,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:36:12,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:12,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:36:12,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:12,445 INFO L87 Difference]: Start difference. First operand 1997 states and 3054 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:14,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:14,947 INFO L93 Difference]: Finished difference Result 3275 states and 5356 transitions. [2022-07-23 12:36:14,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:36:14,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-23 12:36:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:14,961 INFO L225 Difference]: With dead ends: 3275 [2022-07-23 12:36:14,962 INFO L226 Difference]: Without dead ends: 3275 [2022-07-23 12:36:14,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:14,963 INFO L413 NwaCegarLoop]: 5058 mSDtfsCounter, 1489 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1989 SdHoareTripleChecker+Valid, 7481 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:14,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1989 Valid, 7481 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-23 12:36:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2022-07-23 12:36:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 2019. [2022-07-23 12:36:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 1064 states have (on average 1.9774436090225564) internal successors, (2104), 2013 states have internal predecessors, (2104), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-07-23 12:36:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 3110 transitions. [2022-07-23 12:36:15,199 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 3110 transitions. Word has length 8 [2022-07-23 12:36:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:15,199 INFO L495 AbstractCegarLoop]: Abstraction has 2019 states and 3110 transitions. [2022-07-23 12:36:15,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 3110 transitions. [2022-07-23 12:36:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 12:36:15,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:15,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:15,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:15,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:15,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr429REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash 874110197, now seen corresponding path program 1 times [2022-07-23 12:36:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030709303] [2022-07-23 12:36:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:15,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:15,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:15,413 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:15,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-23 12:36:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:15,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:36:15,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:15,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:15,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:15,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030709303] [2022-07-23 12:36:15,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030709303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:15,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:15,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:36:15,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392163501] [2022-07-23 12:36:15,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:15,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:36:15,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:15,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:36:15,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:15,559 INFO L87 Difference]: Start difference. First operand 2019 states and 3110 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:15,802 INFO L93 Difference]: Finished difference Result 3486 states and 5612 transitions. [2022-07-23 12:36:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:36:15,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 12:36:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:15,819 INFO L225 Difference]: With dead ends: 3486 [2022-07-23 12:36:15,819 INFO L226 Difference]: Without dead ends: 3486 [2022-07-23 12:36:15,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:15,820 INFO L413 NwaCegarLoop]: 3606 mSDtfsCounter, 1560 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 6493 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:15,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 6493 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:36:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2022-07-23 12:36:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3193. [2022-07-23 12:36:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 1738 states have (on average 1.9568469505178365) internal successors, (3401), 3187 states have internal predecessors, (3401), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 5407 transitions. [2022-07-23 12:36:16,071 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 5407 transitions. Word has length 11 [2022-07-23 12:36:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:16,071 INFO L495 AbstractCegarLoop]: Abstraction has 3193 states and 5407 transitions. [2022-07-23 12:36:16,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 5407 transitions. [2022-07-23 12:36:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 12:36:16,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:16,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:16,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:16,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:16,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:16,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash -702153283, now seen corresponding path program 1 times [2022-07-23 12:36:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:16,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070093077] [2022-07-23 12:36:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:16,285 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:16,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-23 12:36:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:16,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:36:16,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:16,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:16,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:16,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070093077] [2022-07-23 12:36:16,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070093077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:16,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:16,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:36:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875660856] [2022-07-23 12:36:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:16,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:36:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:36:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:16,408 INFO L87 Difference]: Start difference. First operand 3193 states and 5407 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:16,455 INFO L93 Difference]: Finished difference Result 3347 states and 5547 transitions. [2022-07-23 12:36:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:36:16,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 12:36:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:16,471 INFO L225 Difference]: With dead ends: 3347 [2022-07-23 12:36:16,471 INFO L226 Difference]: Without dead ends: 3347 [2022-07-23 12:36:16,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:16,472 INFO L413 NwaCegarLoop]: 3202 mSDtfsCounter, 1394 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1894 SdHoareTripleChecker+Valid, 4519 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:16,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1894 Valid, 4519 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:36:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2022-07-23 12:36:16,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3133. [2022-07-23 12:36:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 1702 states have (on average 1.9477085781433607) internal successors, (3315), 3127 states have internal predecessors, (3315), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 5321 transitions. [2022-07-23 12:36:16,762 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 5321 transitions. Word has length 13 [2022-07-23 12:36:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:16,762 INFO L495 AbstractCegarLoop]: Abstraction has 3133 states and 5321 transitions. [2022-07-23 12:36:16,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 5321 transitions. [2022-07-23 12:36:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 12:36:16,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:16,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:16,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:16,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:16,973 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr534ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:16,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:16,973 INFO L85 PathProgramCache]: Analyzing trace with hash 240246254, now seen corresponding path program 1 times [2022-07-23 12:36:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:16,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070220808] [2022-07-23 12:36:16,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:16,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:16,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:16,975 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:16,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-23 12:36:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:17,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:36:17,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:17,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 12:36:17,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 12:36:17,201 INFO L356 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2022-07-23 12:36:17,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 36 [2022-07-23 12:36:17,229 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-23 12:36:17,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2022-07-23 12:36:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:17,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:17,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:17,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070220808] [2022-07-23 12:36:17,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070220808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:17,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:17,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:36:17,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718473529] [2022-07-23 12:36:17,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:17,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:36:17,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:17,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:36:17,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:36:17,249 INFO L87 Difference]: Start difference. First operand 3133 states and 5321 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:19,591 INFO L93 Difference]: Finished difference Result 5450 states and 9669 transitions. [2022-07-23 12:36:19,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:36:19,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-23 12:36:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:19,612 INFO L225 Difference]: With dead ends: 5450 [2022-07-23 12:36:19,612 INFO L226 Difference]: Without dead ends: 5450 [2022-07-23 12:36:19,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:36:19,613 INFO L413 NwaCegarLoop]: 3461 mSDtfsCounter, 1330 mSDsluCounter, 5812 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 9273 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:19,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1830 Valid, 9273 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 674 Invalid, 0 Unknown, 37 Unchecked, 2.2s Time] [2022-07-23 12:36:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5450 states. [2022-07-23 12:36:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5450 to 3132. [2022-07-23 12:36:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 1701 states have (on average 1.9476778365667256) internal successors, (3313), 3126 states have internal predecessors, (3313), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 5319 transitions. [2022-07-23 12:36:20,049 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 5319 transitions. Word has length 14 [2022-07-23 12:36:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:20,049 INFO L495 AbstractCegarLoop]: Abstraction has 3132 states and 5319 transitions. [2022-07-23 12:36:20,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 5319 transitions. [2022-07-23 12:36:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 12:36:20,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:20,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:20,063 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-23 12:36:20,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:20,264 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:20,264 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2022-07-23 12:36:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:20,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263551594] [2022-07-23 12:36:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:20,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:20,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:20,266 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:20,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-23 12:36:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:20,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:36:20,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:20,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:20,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:20,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263551594] [2022-07-23 12:36:20,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263551594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:20,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:20,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:36:20,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160360643] [2022-07-23 12:36:20,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:20,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:36:20,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:20,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:36:20,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:20,447 INFO L87 Difference]: Start difference. First operand 3132 states and 5319 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:20,510 INFO L93 Difference]: Finished difference Result 3072 states and 5233 transitions. [2022-07-23 12:36:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:36:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 12:36:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:20,521 INFO L225 Difference]: With dead ends: 3072 [2022-07-23 12:36:20,521 INFO L226 Difference]: Without dead ends: 3072 [2022-07-23 12:36:20,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:36:20,525 INFO L413 NwaCegarLoop]: 2954 mSDtfsCounter, 1933 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2436 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:20,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2436 Valid, 3481 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:36:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-07-23 12:36:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2022-07-23 12:36:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 1665 states have (on average 1.9381381381381382) internal successors, (3227), 3066 states have internal predecessors, (3227), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 5233 transitions. [2022-07-23 12:36:20,783 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 5233 transitions. Word has length 18 [2022-07-23 12:36:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:20,784 INFO L495 AbstractCegarLoop]: Abstraction has 3072 states and 5233 transitions. [2022-07-23 12:36:20,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 5233 transitions. [2022-07-23 12:36:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 12:36:20,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:20,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:20,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:20,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:20,985 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:20,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2022-07-23 12:36:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:20,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943512458] [2022-07-23 12:36:20,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:20,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:20,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:20,988 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:20,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-23 12:36:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:21,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:36:21,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:21,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:21,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:21,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943512458] [2022-07-23 12:36:21,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943512458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:21,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:21,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:36:21,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54290165] [2022-07-23 12:36:21,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:21,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:36:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:21,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:36:21,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:36:21,162 INFO L87 Difference]: Start difference. First operand 3072 states and 5233 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:21,251 INFO L93 Difference]: Finished difference Result 3044 states and 5177 transitions. [2022-07-23 12:36:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:36:21,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-23 12:36:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:21,260 INFO L225 Difference]: With dead ends: 3044 [2022-07-23 12:36:21,261 INFO L226 Difference]: Without dead ends: 3044 [2022-07-23 12:36:21,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:36:21,262 INFO L413 NwaCegarLoop]: 2909 mSDtfsCounter, 1904 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 6338 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:21,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 6338 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:36:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2022-07-23 12:36:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3042. [2022-07-23 12:36:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 1649 states have (on average 1.9217707701637357) internal successors, (3169), 3036 states have internal predecessors, (3169), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 5175 transitions. [2022-07-23 12:36:21,496 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 5175 transitions. Word has length 20 [2022-07-23 12:36:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:21,496 INFO L495 AbstractCegarLoop]: Abstraction has 3042 states and 5175 transitions. [2022-07-23 12:36:21,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 5175 transitions. [2022-07-23 12:36:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 12:36:21,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:21,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:21,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:21,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:21,710 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2022-07-23 12:36:21,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:21,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572548226] [2022-07-23 12:36:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:21,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:21,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:21,713 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:21,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-23 12:36:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:21,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:36:21,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:21,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:21,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:21,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:21,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572548226] [2022-07-23 12:36:21,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572548226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:21,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:21,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:36:21,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704524280] [2022-07-23 12:36:21,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:21,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:36:21,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:21,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:36:21,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:36:21,932 INFO L87 Difference]: Start difference. First operand 3042 states and 5175 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:25,163 INFO L93 Difference]: Finished difference Result 5473 states and 9671 transitions. [2022-07-23 12:36:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:36:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-23 12:36:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:25,184 INFO L225 Difference]: With dead ends: 5473 [2022-07-23 12:36:25,184 INFO L226 Difference]: Without dead ends: 5473 [2022-07-23 12:36:25,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:36:25,185 INFO L413 NwaCegarLoop]: 2988 mSDtfsCounter, 3442 mSDsluCounter, 3514 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 1019 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 6502 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1019 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:25,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 6502 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1019 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-23 12:36:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2022-07-23 12:36:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 3038. [2022-07-23 12:36:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 1649 states have (on average 1.9169193450576107) internal successors, (3161), 3032 states have internal predecessors, (3161), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 5167 transitions. [2022-07-23 12:36:25,645 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 5167 transitions. Word has length 34 [2022-07-23 12:36:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:25,646 INFO L495 AbstractCegarLoop]: Abstraction has 3038 states and 5167 transitions. [2022-07-23 12:36:25,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 5167 transitions. [2022-07-23 12:36:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 12:36:25,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:25,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:25,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:25,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:25,860 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2022-07-23 12:36:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:25,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309972405] [2022-07-23 12:36:25,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:25,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:25,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:25,864 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:25,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-23 12:36:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:26,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 12:36:26,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:26,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:26,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:26,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:26,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309972405] [2022-07-23 12:36:26,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309972405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:26,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:26,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:36:26,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632652871] [2022-07-23 12:36:26,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:26,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:36:26,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:26,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:36:26,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:36:26,206 INFO L87 Difference]: Start difference. First operand 3038 states and 5167 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:30,679 INFO L93 Difference]: Finished difference Result 5530 states and 9693 transitions. [2022-07-23 12:36:30,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:36:30,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-23 12:36:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:30,699 INFO L225 Difference]: With dead ends: 5530 [2022-07-23 12:36:30,700 INFO L226 Difference]: Without dead ends: 5530 [2022-07-23 12:36:30,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:36:30,701 INFO L413 NwaCegarLoop]: 5152 mSDtfsCounter, 2908 mSDsluCounter, 4930 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 10082 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:30,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2908 Valid, 10082 Invalid, 3174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-23 12:36:30,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2022-07-23 12:36:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 3034. [2022-07-23 12:36:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 1649 states have (on average 1.9120679199514858) internal successors, (3153), 3028 states have internal predecessors, (3153), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 5159 transitions. [2022-07-23 12:36:31,203 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 5159 transitions. Word has length 34 [2022-07-23 12:36:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:31,204 INFO L495 AbstractCegarLoop]: Abstraction has 3034 states and 5159 transitions. [2022-07-23 12:36:31,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 5159 transitions. [2022-07-23 12:36:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 12:36:31,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:31,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:31,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:31,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:31,416 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:31,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2022-07-23 12:36:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:31,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736761315] [2022-07-23 12:36:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:31,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:31,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:31,421 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:31,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-23 12:36:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:31,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:36:31,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:31,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:31,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:31,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736761315] [2022-07-23 12:36:31,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736761315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:31,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:31,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:36:31,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412499352] [2022-07-23 12:36:31,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:31,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:36:31,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:31,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:36:31,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:36:31,719 INFO L87 Difference]: Start difference. First operand 3034 states and 5159 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:31,787 INFO L93 Difference]: Finished difference Result 3022 states and 5139 transitions. [2022-07-23 12:36:31,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:36:31,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-23 12:36:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:31,796 INFO L225 Difference]: With dead ends: 3022 [2022-07-23 12:36:31,796 INFO L226 Difference]: Without dead ends: 3022 [2022-07-23 12:36:31,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:36:31,798 INFO L413 NwaCegarLoop]: 2903 mSDtfsCounter, 1880 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 6316 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:31,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2383 Valid, 6316 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:36:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2022-07-23 12:36:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2022-07-23 12:36:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 1637 states have (on average 1.9138668295662797) internal successors, (3133), 3016 states have internal predecessors, (3133), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 5139 transitions. [2022-07-23 12:36:32,011 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 5139 transitions. Word has length 52 [2022-07-23 12:36:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:32,011 INFO L495 AbstractCegarLoop]: Abstraction has 3022 states and 5139 transitions. [2022-07-23 12:36:32,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 5139 transitions. [2022-07-23 12:36:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-23 12:36:32,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:32,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:32,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:32,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:32,227 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:32,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2022-07-23 12:36:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:32,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634815585] [2022-07-23 12:36:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:32,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:32,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:32,231 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:32,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-23 12:36:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:32,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 12:36:32,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:32,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:32,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:33,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:36:33,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 12:36:33,135 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:36:33,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 12:36:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:33,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:33,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:33,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634815585] [2022-07-23 12:36:33,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634815585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:33,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:33,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:36:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465098506] [2022-07-23 12:36:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:33,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:36:33,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:33,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:36:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:36:33,151 INFO L87 Difference]: Start difference. First operand 3022 states and 5139 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:37,302 INFO L93 Difference]: Finished difference Result 5224 states and 9400 transitions. [2022-07-23 12:36:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:36:37,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-23 12:36:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:37,320 INFO L225 Difference]: With dead ends: 5224 [2022-07-23 12:36:37,321 INFO L226 Difference]: Without dead ends: 5224 [2022-07-23 12:36:37,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:36:37,321 INFO L413 NwaCegarLoop]: 2951 mSDtfsCounter, 4397 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5400 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:37,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5400 Valid, 4163 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-23 12:36:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2022-07-23 12:36:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 2952. [2022-07-23 12:36:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2952 states, 1605 states have (on average 1.8872274143302181) internal successors, (3029), 2946 states have internal predecessors, (3029), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 5035 transitions. [2022-07-23 12:36:37,827 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 5035 transitions. Word has length 60 [2022-07-23 12:36:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:37,828 INFO L495 AbstractCegarLoop]: Abstraction has 2952 states and 5035 transitions. [2022-07-23 12:36:37,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 5035 transitions. [2022-07-23 12:36:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 12:36:37,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:37,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:37,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:38,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:38,050 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2022-07-23 12:36:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:38,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353209299] [2022-07-23 12:36:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:38,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:38,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:38,056 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:38,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-23 12:36:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:38,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:36:38,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:38,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:38,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:36:38,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 12:36:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:38,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:38,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:38,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353209299] [2022-07-23 12:36:38,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353209299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:38,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:38,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:36:38,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238281594] [2022-07-23 12:36:38,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:38,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:36:38,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:38,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:36:38,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:36:38,337 INFO L87 Difference]: Start difference. First operand 2952 states and 5035 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:39,909 INFO L93 Difference]: Finished difference Result 2951 states and 5034 transitions. [2022-07-23 12:36:39,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:36:39,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-23 12:36:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:39,921 INFO L225 Difference]: With dead ends: 2951 [2022-07-23 12:36:39,922 INFO L226 Difference]: Without dead ends: 2951 [2022-07-23 12:36:39,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 12:36:39,924 INFO L413 NwaCegarLoop]: 2863 mSDtfsCounter, 4 mSDsluCounter, 7351 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10214 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:39,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10214 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-23 12:36:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-07-23 12:36:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2951. [2022-07-23 12:36:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 1605 states have (on average 1.8866043613707164) internal successors, (3028), 2945 states have internal predecessors, (3028), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 5034 transitions. [2022-07-23 12:36:40,167 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 5034 transitions. Word has length 65 [2022-07-23 12:36:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:40,168 INFO L495 AbstractCegarLoop]: Abstraction has 2951 states and 5034 transitions. [2022-07-23 12:36:40,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 5034 transitions. [2022-07-23 12:36:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 12:36:40,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:40,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:40,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:40,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:40,384 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:40,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:40,385 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2022-07-23 12:36:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:40,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039250928] [2022-07-23 12:36:40,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:40,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:40,387 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:40,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-23 12:36:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:40,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 12:36:40,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:40,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:36:40,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:36:40,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:36:40,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 12:36:40,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 12:36:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:40,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:40,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:40,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039250928] [2022-07-23 12:36:40,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039250928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:40,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:40,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:36:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405281881] [2022-07-23 12:36:40,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:40,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:36:40,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:40,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:36:40,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:36:40,761 INFO L87 Difference]: Start difference. First operand 2951 states and 5034 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:42,999 INFO L93 Difference]: Finished difference Result 2950 states and 5033 transitions. [2022-07-23 12:36:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:36:43,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-23 12:36:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:43,012 INFO L225 Difference]: With dead ends: 2950 [2022-07-23 12:36:43,012 INFO L226 Difference]: Without dead ends: 2950 [2022-07-23 12:36:43,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 12:36:43,013 INFO L413 NwaCegarLoop]: 2863 mSDtfsCounter, 2 mSDsluCounter, 7387 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10250 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:43,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10250 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-23 12:36:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2022-07-23 12:36:43,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2950. [2022-07-23 12:36:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 1604 states have (on average 1.8871571072319202) internal successors, (3027), 2944 states have internal predecessors, (3027), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:36:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5033 transitions. [2022-07-23 12:36:43,272 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5033 transitions. Word has length 65 [2022-07-23 12:36:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:43,272 INFO L495 AbstractCegarLoop]: Abstraction has 2950 states and 5033 transitions. [2022-07-23 12:36:43,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:36:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5033 transitions. [2022-07-23 12:36:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-23 12:36:43,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:43,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:43,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:43,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:43,487 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1522422575, now seen corresponding path program 1 times [2022-07-23 12:36:43,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:43,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126275047] [2022-07-23 12:36:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:43,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:43,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:43,490 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:43,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-23 12:36:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:43,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:36:43,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:43,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:36:43,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:43,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126275047] [2022-07-23 12:36:43,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126275047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:36:43,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:36:43,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:36:43,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85728792] [2022-07-23 12:36:43,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:36:43,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:36:43,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:43,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:36:43,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:36:43,794 INFO L87 Difference]: Start difference. First operand 2950 states and 5033 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 12:36:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:43,861 INFO L93 Difference]: Finished difference Result 2953 states and 5037 transitions. [2022-07-23 12:36:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:36:43,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-07-23 12:36:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:43,888 INFO L225 Difference]: With dead ends: 2953 [2022-07-23 12:36:43,888 INFO L226 Difference]: Without dead ends: 2953 [2022-07-23 12:36:43,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:36:43,889 INFO L413 NwaCegarLoop]: 2863 mSDtfsCounter, 2 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8584 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:43,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8584 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:36:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2022-07-23 12:36:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2953. [2022-07-23 12:36:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 1606 states have (on average 1.8866749688667497) internal successors, (3030), 2947 states have internal predecessors, (3030), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-07-23 12:36:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 5037 transitions. [2022-07-23 12:36:44,156 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 5037 transitions. Word has length 73 [2022-07-23 12:36:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:44,157 INFO L495 AbstractCegarLoop]: Abstraction has 2953 states and 5037 transitions. [2022-07-23 12:36:44,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 12:36:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 5037 transitions. [2022-07-23 12:36:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-23 12:36:44,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:44,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:44,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:44,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:44,371 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:44,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1741939320, now seen corresponding path program 1 times [2022-07-23 12:36:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:44,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498628507] [2022-07-23 12:36:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:36:44,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:44,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:44,374 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:44,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-23 12:36:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:36:44,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:36:44,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:44,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:36:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:44,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:44,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498628507] [2022-07-23 12:36:44,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498628507] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:36:44,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:36:44,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 12:36:44,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269345467] [2022-07-23 12:36:44,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:36:44,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 12:36:44,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:44,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 12:36:44,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 12:36:44,750 INFO L87 Difference]: Start difference. First operand 2953 states and 5037 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:36:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:44,934 INFO L93 Difference]: Finished difference Result 2965 states and 5054 transitions. [2022-07-23 12:36:44,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 12:36:44,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-07-23 12:36:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:44,946 INFO L225 Difference]: With dead ends: 2965 [2022-07-23 12:36:44,946 INFO L226 Difference]: Without dead ends: 2965 [2022-07-23 12:36:44,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-23 12:36:44,947 INFO L413 NwaCegarLoop]: 2864 mSDtfsCounter, 22 mSDsluCounter, 5724 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 8588 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:44,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 8588 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:36:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2022-07-23 12:36:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2963. [2022-07-23 12:36:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2963 states, 1615 states have (on average 1.8854489164086687) internal successors, (3045), 2956 states have internal predecessors, (3045), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-07-23 12:36:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 5052 transitions. [2022-07-23 12:36:45,211 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 5052 transitions. Word has length 74 [2022-07-23 12:36:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:45,212 INFO L495 AbstractCegarLoop]: Abstraction has 2963 states and 5052 transitions. [2022-07-23 12:36:45,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:36:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 5052 transitions. [2022-07-23 12:36:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 12:36:45,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:45,214 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:45,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:45,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:45,430 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:45,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash 755671407, now seen corresponding path program 2 times [2022-07-23 12:36:45,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:45,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65234733] [2022-07-23 12:36:45,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 12:36:45,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:45,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:45,432 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:45,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-23 12:36:45,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 12:36:45,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:36:45,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:36:45,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:45,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:36:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:46,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:46,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65234733] [2022-07-23 12:36:46,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65234733] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:36:46,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:36:46,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-23 12:36:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608973133] [2022-07-23 12:36:46,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:36:46,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 12:36:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 12:36:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 12:36:46,126 INFO L87 Difference]: Start difference. First operand 2963 states and 5052 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:36:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:46,664 INFO L93 Difference]: Finished difference Result 2984 states and 5080 transitions. [2022-07-23 12:36:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 12:36:46,665 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-07-23 12:36:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:46,675 INFO L225 Difference]: With dead ends: 2984 [2022-07-23 12:36:46,675 INFO L226 Difference]: Without dead ends: 2980 [2022-07-23 12:36:46,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-23 12:36:46,676 INFO L413 NwaCegarLoop]: 2867 mSDtfsCounter, 67 mSDsluCounter, 14318 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 17185 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:46,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 17185 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:36:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2022-07-23 12:36:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2972. [2022-07-23 12:36:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 1624 states have (on average 1.8823891625615763) internal successors, (3057), 2965 states have internal predecessors, (3057), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-07-23 12:36:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 5064 transitions. [2022-07-23 12:36:46,919 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 5064 transitions. Word has length 77 [2022-07-23 12:36:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:46,919 INFO L495 AbstractCegarLoop]: Abstraction has 2972 states and 5064 transitions. [2022-07-23 12:36:46,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:36:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 5064 transitions. [2022-07-23 12:36:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 12:36:46,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:46,920 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:46,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:47,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:47,136 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1043203377, now seen corresponding path program 3 times [2022-07-23 12:36:47,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:47,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752703971] [2022-07-23 12:36:47,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 12:36:47,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:47,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:47,138 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:47,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-23 12:36:47,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 12:36:47,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:36:47,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 12:36:47,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:47,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:36:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:48,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:48,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752703971] [2022-07-23 12:36:48,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752703971] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:36:48,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:36:48,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 12:36:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254053485] [2022-07-23 12:36:48,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:36:48,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 12:36:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:48,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 12:36:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-23 12:36:48,592 INFO L87 Difference]: Start difference. First operand 2972 states and 5064 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:36:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:36:51,361 INFO L93 Difference]: Finished difference Result 3014 states and 5126 transitions. [2022-07-23 12:36:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-23 12:36:51,362 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2022-07-23 12:36:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:36:51,370 INFO L225 Difference]: With dead ends: 3014 [2022-07-23 12:36:51,371 INFO L226 Difference]: Without dead ends: 3008 [2022-07-23 12:36:51,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 12:36:51,372 INFO L413 NwaCegarLoop]: 2872 mSDtfsCounter, 162 mSDsluCounter, 40120 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 42992 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 12:36:51,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 42992 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 12:36:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-07-23 12:36:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2990. [2022-07-23 12:36:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 1642 states have (on average 1.8757612667478685) internal successors, (3080), 2983 states have internal predecessors, (3080), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-07-23 12:36:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 5087 transitions. [2022-07-23 12:36:51,615 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 5087 transitions. Word has length 83 [2022-07-23 12:36:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:36:51,615 INFO L495 AbstractCegarLoop]: Abstraction has 2990 states and 5087 transitions. [2022-07-23 12:36:51,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:36:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 5087 transitions. [2022-07-23 12:36:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-23 12:36:51,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:36:51,617 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:36:51,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-23 12:36:51,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:36:51,831 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:36:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:36:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash -420145777, now seen corresponding path program 4 times [2022-07-23 12:36:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:36:51,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368938348] [2022-07-23 12:36:51,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 12:36:51,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:36:51,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:36:51,834 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:36:51,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-23 12:36:52,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 12:36:52,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:36:52,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 12:36:52,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:36:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:52,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:36:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:36:53,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:36:53,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368938348] [2022-07-23 12:36:53,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368938348] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:36:53,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:36:53,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-23 12:36:53,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803484850] [2022-07-23 12:36:53,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:36:53,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 12:36:53,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:36:53,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 12:36:53,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 12:36:53,844 INFO L87 Difference]: Start difference. First operand 2990 states and 5087 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:37:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:37:03,954 INFO L93 Difference]: Finished difference Result 3070 states and 5199 transitions. [2022-07-23 12:37:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-23 12:37:03,955 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2022-07-23 12:37:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:37:03,962 INFO L225 Difference]: With dead ends: 3070 [2022-07-23 12:37:03,962 INFO L226 Difference]: Without dead ends: 3066 [2022-07-23 12:37:03,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-23 12:37:03,966 INFO L413 NwaCegarLoop]: 2884 mSDtfsCounter, 428 mSDsluCounter, 66245 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 69129 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:37:03,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 69129 Invalid, 2843 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [399 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-23 12:37:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2022-07-23 12:37:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3024. [2022-07-23 12:37:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3024 states, 1676 states have (on average 1.8651551312649164) internal successors, (3126), 3017 states have internal predecessors, (3126), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-07-23 12:37:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 5133 transitions. [2022-07-23 12:37:04,207 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 5133 transitions. Word has length 95 [2022-07-23 12:37:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:37:04,208 INFO L495 AbstractCegarLoop]: Abstraction has 3024 states and 5133 transitions. [2022-07-23 12:37:04,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:37:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 5133 transitions. [2022-07-23 12:37:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 12:37:04,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:37:04,209 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:37:04,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-23 12:37:04,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:37:04,428 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:37:04,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:37:04,428 INFO L85 PathProgramCache]: Analyzing trace with hash 795332591, now seen corresponding path program 5 times [2022-07-23 12:37:04,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:37:04,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813093497] [2022-07-23 12:37:04,429 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:37:04,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:37:04,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:37:04,431 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:37:04,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-23 12:37:05,750 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:37:05,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:37:05,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-23 12:37:05,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:37:05,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:37:05,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:37:05,883 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:37:05,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 12:37:05,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:37:05,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:37:05,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-23 12:37:05,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-23 12:37:06,033 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1911))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,044 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,055 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-07-23 12:37:06,095 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,132 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,143 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1925))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1924)))) is different from true [2022-07-23 12:37:06,179 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:37:06,216 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932)))) is different from true [2022-07-23 12:37:06,226 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,237 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,270 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,359 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,368 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,397 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,405 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,414 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960)))) is different from true [2022-07-23 12:37:06,472 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966)))) is different from true [2022-07-23 12:37:06,507 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,518 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:37:06,528 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,586 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,622 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,631 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986)))) is different from true [2022-07-23 12:37:06,640 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,648 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,657 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,666 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,676 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:37:06,712 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:37:06,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 12:37:06,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 12:37:06,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 12:37:06,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 12:37:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2022-07-23 12:37:06,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:37:07,424 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2088) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-23 12:37:07,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:37:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813093497] [2022-07-23 12:37:07,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813093497] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:37:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [278085777] [2022-07-23 12:37:07,430 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:37:07,430 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 12:37:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 12:37:07,432 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 12:37:07,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-07-23 12:38:38,410 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:38:38,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:38:38,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-23 12:38:38,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:38:38,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:38:38,753 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:38:38,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 12:38:38,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:38:38,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:38:38,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:38:38,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-23 12:38:38,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-23 12:38:38,904 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:38,913 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:38,923 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:38,935 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473)))) is different from true [2022-07-23 12:38:38,943 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:38,952 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:38,963 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:38:38,974 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:38,986 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:38,996 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-07-23 12:38:39,007 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,018 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,028 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,040 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,051 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496)))) is different from true [2022-07-23 12:38:39,062 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,100 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,111 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,122 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:38:39,133 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508)))) is different from true [2022-07-23 12:38:39,168 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,178 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,189 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,199 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,210 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,221 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,231 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,268 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-07-23 12:38:39,278 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,317 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-07-23 12:38:39,328 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-07-23 12:38:39,340 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:38:39,351 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,362 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:38:39,373 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:38:39,384 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,395 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,406 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,418 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:38:39,455 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:38:39,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 12:38:39,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 12:38:39,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 12:38:39,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 12:38:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 975 not checked. [2022-07-23 12:38:39,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:38:40,091 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2644 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2643 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-23 12:38:40,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [278085777] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:38:40,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:38:40,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 47] total 75 [2022-07-23 12:38:40,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95000723] [2022-07-23 12:38:40,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:38:40,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-23 12:38:40,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:38:40,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-23 12:38:40,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=148, Unknown=77, NotChecked=5934, Total=6320 [2022-07-23 12:38:40,100 INFO L87 Difference]: Start difference. First operand 3024 states and 5133 transitions. Second operand has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 76 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:38:40,600 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-07-23 12:38:40,615 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1925))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915))) (exists ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1924)))) is different from true [2022-07-23 12:38:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:38:48,827 INFO L93 Difference]: Finished difference Result 5270 states and 9439 transitions. [2022-07-23 12:38:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 12:38:48,829 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 76 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 117 [2022-07-23 12:38:48,829 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-07-23 12:38:48,829 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 76 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 117