./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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_JEN_test4-1.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 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 13:02:29,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 13:02:29,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 13:02:29,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 13:02:29,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 13:02:29,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 13:02:29,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 13:02:29,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 13:02:29,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 13:02:29,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 13:02:29,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 13:02:29,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 13:02:29,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 13:02:29,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 13:02:29,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 13:02:29,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 13:02:29,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 13:02:29,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 13:02:29,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 13:02:29,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 13:02:29,523 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 13:02:29,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 13:02:29,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 13:02:29,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 13:02:29,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 13:02:29,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 13:02:29,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 13:02:29,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 13:02:29,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 13:02:29,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 13:02:29,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 13:02:29,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 13:02:29,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 13:02:29,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 13:02:29,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 13:02:29,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 13:02:29,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 13:02:29,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 13:02:29,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 13:02:29,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 13:02:29,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 13:02:29,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 13:02:29,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 13:02:29,571 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 13:02:29,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 13:02:29,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 13:02:29,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 13:02:29,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 13:02:29,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 13:02:29,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 13:02:29,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 13:02:29,574 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 13:02:29,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 13:02:29,575 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 13:02:29,576 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 13:02:29,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 13:02:29,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 13:02:29,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 13:02:29,576 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 13:02:29,576 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 13:02:29,577 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 13:02:29,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 13:02:29,578 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 13:02:29,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 13:02:29,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 13:02:29,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 13:02:29,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 13:02:29,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 13:02:29,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 13:02:29,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 13:02:29,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 13:02:29,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 13:02:29,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 13:02:29,580 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 -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2022-07-20 13:02:29,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 13:02:29,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 13:02:29,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 13:02:29,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 13:02:29,863 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 13:02:29,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2022-07-20 13:02:29,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de97d80ab/bc1bb1b483724a64bf2c6b18c0906540/FLAG75400a417 [2022-07-20 13:02:30,519 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 13:02:30,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2022-07-20 13:02:30,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de97d80ab/bc1bb1b483724a64bf2c6b18c0906540/FLAG75400a417 [2022-07-20 13:02:30,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de97d80ab/bc1bb1b483724a64bf2c6b18c0906540 [2022-07-20 13:02:30,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 13:02:30,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 13:02:30,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 13:02:30,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 13:02:30,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 13:02:30,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:02:30" (1/1) ... [2022-07-20 13:02:30,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6268c085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:30, skipping insertion in model container [2022-07-20 13:02:30,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:02:30" (1/1) ... [2022-07-20 13:02:30,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 13:02:30,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 13:02:31,191 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_JEN_test4-1.i[33021,33034] [2022-07-20 13:02:31,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:02:31,336 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-20 13:02:31,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4e76db31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:31, skipping insertion in model container [2022-07-20 13:02:31,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 13:02:31,337 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-20 13:02:31,339 INFO L158 Benchmark]: Toolchain (without parser) took 551.62ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 66.6MB in the beginning and 108.2MB in the end (delta: -41.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 13:02:31,340 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory was 55.9MB in the beginning and 55.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 13:02:31,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.55ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 66.3MB in the beginning and 108.2MB in the end (delta: -41.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 13:02:31,342 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.18ms. Allocated memory is still 98.6MB. Free memory was 55.9MB in the beginning and 55.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.55ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 66.3MB in the beginning and 108.2MB in the end (delta: -41.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.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 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 13:02:33,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 13:02:33,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 13:02:33,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 13:02:33,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 13:02:33,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 13:02:33,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 13:02:33,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 13:02:33,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 13:02:33,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 13:02:33,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 13:02:33,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 13:02:33,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 13:02:33,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 13:02:33,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 13:02:33,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 13:02:33,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 13:02:33,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 13:02:33,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 13:02:33,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 13:02:33,181 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 13:02:33,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 13:02:33,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 13:02:33,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 13:02:33,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 13:02:33,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 13:02:33,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 13:02:33,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 13:02:33,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 13:02:33,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 13:02:33,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 13:02:33,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 13:02:33,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 13:02:33,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 13:02:33,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 13:02:33,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 13:02:33,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 13:02:33,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 13:02:33,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 13:02:33,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 13:02:33,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 13:02:33,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 13:02:33,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 13:02:33,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 13:02:33,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 13:02:33,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 13:02:33,235 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 13:02:33,236 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 13:02:33,236 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 13:02:33,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 13:02:33,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 13:02:33,237 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 13:02:33,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 13:02:33,238 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 13:02:33,238 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 13:02:33,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 13:02:33,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 13:02:33,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 13:02:33,249 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 13:02:33,249 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 13:02:33,249 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 13:02:33,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 13:02:33,249 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 13:02:33,250 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 13:02:33,250 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 13:02:33,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 13:02:33,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 13:02:33,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 13:02:33,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 13:02:33,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 13:02:33,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 13:02:33,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 13:02:33,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 13:02:33,252 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 13:02:33,252 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 13:02:33,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 13:02:33,253 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 -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2022-07-20 13:02:33,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 13:02:33,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 13:02:33,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 13:02:33,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 13:02:33,586 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 13:02:33,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2022-07-20 13:02:33,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c1d03be/c9ab78a6d27443989359b2922b2a8c48/FLAG82c142da9 [2022-07-20 13:02:34,248 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 13:02:34,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2022-07-20 13:02:34,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c1d03be/c9ab78a6d27443989359b2922b2a8c48/FLAG82c142da9 [2022-07-20 13:02:34,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c1d03be/c9ab78a6d27443989359b2922b2a8c48 [2022-07-20 13:02:34,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 13:02:34,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 13:02:34,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 13:02:34,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 13:02:34,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 13:02:34,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:02:34" (1/1) ... [2022-07-20 13:02:34,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19158bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:34, skipping insertion in model container [2022-07-20 13:02:34,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:02:34" (1/1) ... [2022-07-20 13:02:34,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 13:02:34,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 13:02:35,092 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_JEN_test4-1.i[33021,33034] [2022-07-20 13:02:35,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:02:35,257 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 13:02:35,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 13:02:35,297 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_JEN_test4-1.i[33021,33034] [2022-07-20 13:02:35,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:02:35,379 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 13:02:35,403 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_JEN_test4-1.i[33021,33034] [2022-07-20 13:02:35,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 13:02:35,502 INFO L208 MainTranslator]: Completed translation [2022-07-20 13:02:35,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35 WrapperNode [2022-07-20 13:02:35,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 13:02:35,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 13:02:35,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 13:02:35,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 13:02:35,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (1/1) ... [2022-07-20 13:02:35,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (1/1) ... [2022-07-20 13:02:35,620 INFO L137 Inliner]: procedures = 180, calls = 349, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1166 [2022-07-20 13:02:35,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 13:02:35,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 13:02:35,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 13:02:35,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 13:02:35,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (1/1) ... [2022-07-20 13:02:35,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (1/1) ... [2022-07-20 13:02:35,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (1/1) ... [2022-07-20 13:02:35,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (1/1) ... [2022-07-20 13:02:35,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (1/1) ... [2022-07-20 13:02:35,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (1/1) ... [2022-07-20 13:02:35,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (1/1) ... [2022-07-20 13:02:35,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 13:02:35,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 13:02:35,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 13:02:35,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 13:02:35,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (1/1) ... [2022-07-20 13:02:35,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 13:02:35,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 13:02:35,792 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-20 13:02:35,812 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-20 13:02:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-20 13:02:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 13:02:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-20 13:02:35,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-20 13:02:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 13:02:35,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 13:02:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 13:02:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 13:02:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 13:02:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 13:02:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 13:02:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 13:02:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 13:02:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 13:02:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 13:02:35,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 13:02:36,022 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 13:02:36,031 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 13:02:36,050 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 13:02:40,775 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 13:02:40,786 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 13:02:40,787 INFO L299 CfgBuilder]: Removed 60 assume(true) statements. [2022-07-20 13:02:40,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:02:40 BoogieIcfgContainer [2022-07-20 13:02:40,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 13:02:40,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 13:02:40,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 13:02:40,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 13:02:40,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 01:02:34" (1/3) ... [2022-07-20 13:02:40,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cd7248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:02:40, skipping insertion in model container [2022-07-20 13:02:40,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:02:35" (2/3) ... [2022-07-20 13:02:40,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cd7248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:02:40, skipping insertion in model container [2022-07-20 13:02:40,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:02:40" (3/3) ... [2022-07-20 13:02:40,797 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-1.i [2022-07-20 13:02:40,809 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 13:02:40,809 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2022-07-20 13:02:40,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 13:02:40,863 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@3f365fa4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32de5579 [2022-07-20 13:02:40,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2022-07-20 13:02:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 1274 states, 613 states have (on average 2.257748776508972) internal successors, (1384), 1265 states have internal predecessors, (1384), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 13:02:40,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:40,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 13:02:40,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:40,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-20 13:02:40,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:40,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706358240] [2022-07-20 13:02:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:40,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:40,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:40,895 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-20 13:02:40,935 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-20 13:02:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:41,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-20 13:02:41,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:41,069 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-20 13:02:41,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:41,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:41,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706358240] [2022-07-20 13:02:41,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706358240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:41,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:41,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:02:41,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873913168] [2022-07-20 13:02:41,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:41,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 13:02:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:41,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 13:02:41,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 13:02:41,107 INFO L87 Difference]: Start difference. First operand has 1274 states, 613 states have (on average 2.257748776508972) internal successors, (1384), 1265 states have internal predecessors, (1384), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:41,176 INFO L93 Difference]: Finished difference Result 1256 states and 1330 transitions. [2022-07-20 13:02:41,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 13:02:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 13:02:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:41,200 INFO L225 Difference]: With dead ends: 1256 [2022-07-20 13:02:41,200 INFO L226 Difference]: Without dead ends: 1254 [2022-07-20 13:02:41,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 13:02:41,205 INFO L413 NwaCegarLoop]: 1330 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:02:41,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:02:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-07-20 13:02:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2022-07-20 13:02:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 604 states have (on average 2.1456953642384105) internal successors, (1296), 1245 states have internal predecessors, (1296), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1328 transitions. [2022-07-20 13:02:41,304 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1328 transitions. Word has length 5 [2022-07-20 13:02:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:41,305 INFO L495 AbstractCegarLoop]: Abstraction has 1254 states and 1328 transitions. [2022-07-20 13:02:41,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1328 transitions. [2022-07-20 13:02:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 13:02:41,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:41,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 13:02:41,320 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-20 13:02:41,518 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-20 13:02:41,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-20 13:02:41,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:41,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374884052] [2022-07-20 13:02:41,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:41,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:41,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:41,523 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-20 13:02:41,525 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-20 13:02:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:41,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:02:41,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:41,701 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-20 13:02:41,712 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-20 13:02:41,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:41,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:41,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374884052] [2022-07-20 13:02:41,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374884052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:41,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:41,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:02:41,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113357054] [2022-07-20 13:02:41,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:41,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:02:41,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:41,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:02:41,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:02:41,716 INFO L87 Difference]: Start difference. First operand 1254 states and 1328 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:43,643 INFO L93 Difference]: Finished difference Result 1291 states and 1378 transitions. [2022-07-20 13:02:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:02:43,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 13:02:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:43,649 INFO L225 Difference]: With dead ends: 1291 [2022-07-20 13:02:43,649 INFO L226 Difference]: Without dead ends: 1291 [2022-07-20 13:02:43,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:02:43,651 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1159 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 13:02:43,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 704 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 13:02:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-07-20 13:02:43,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1237. [2022-07-20 13:02:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 680 states have (on average 1.9676470588235293) internal successors, (1338), 1228 states have internal predecessors, (1338), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1370 transitions. [2022-07-20 13:02:43,677 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1370 transitions. Word has length 5 [2022-07-20 13:02:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:43,677 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1370 transitions. [2022-07-20 13:02:43,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1370 transitions. [2022-07-20 13:02:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 13:02:43,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:43,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 13:02:43,694 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-20 13:02:43,891 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-20 13:02:43,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-20 13:02:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:43,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007635763] [2022-07-20 13:02:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:43,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:43,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:43,894 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-20 13:02:43,896 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-20 13:02:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:44,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:02:44,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:44,014 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-20 13:02:44,034 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-20 13:02:44,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:44,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:44,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007635763] [2022-07-20 13:02:44,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007635763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:44,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:44,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 13:02:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540628628] [2022-07-20 13:02:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:44,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:02:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:44,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:02:44,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:02:44,038 INFO L87 Difference]: Start difference. First operand 1237 states and 1370 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:46,434 INFO L93 Difference]: Finished difference Result 1540 states and 1693 transitions. [2022-07-20 13:02:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:02:46,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 13:02:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:46,439 INFO L225 Difference]: With dead ends: 1540 [2022-07-20 13:02:46,440 INFO L226 Difference]: Without dead ends: 1540 [2022-07-20 13:02:46,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:02:46,441 INFO L413 NwaCegarLoop]: 996 mSDtfsCounter, 504 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 13:02:46,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1483 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 13:02:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2022-07-20 13:02:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1393. [2022-07-20 13:02:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 846 states have (on average 1.9432624113475176) internal successors, (1644), 1384 states have internal predecessors, (1644), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1676 transitions. [2022-07-20 13:02:46,469 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1676 transitions. Word has length 5 [2022-07-20 13:02:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:46,469 INFO L495 AbstractCegarLoop]: Abstraction has 1393 states and 1676 transitions. [2022-07-20 13:02:46,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1676 transitions. [2022-07-20 13:02:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 13:02:46,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:46,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 13:02:46,485 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-20 13:02:46,681 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-20 13:02:46,682 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:46,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-20 13:02:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:46,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484413789] [2022-07-20 13:02:46,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:46,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:46,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:46,685 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-20 13:02:46,687 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-20 13:02:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:46,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 13:02:46,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:46,798 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-20 13:02:46,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:46,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:46,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484413789] [2022-07-20 13:02:46,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484413789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:46,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:46,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:02:46,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120199174] [2022-07-20 13:02:46,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:46,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:02:46,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:46,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:02:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:02:46,806 INFO L87 Difference]: Start difference. First operand 1393 states and 1676 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:46,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:46,894 INFO L93 Difference]: Finished difference Result 2737 states and 3283 transitions. [2022-07-20 13:02:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:02:46,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 13:02:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:46,911 INFO L225 Difference]: With dead ends: 2737 [2022-07-20 13:02:46,912 INFO L226 Difference]: Without dead ends: 2737 [2022-07-20 13:02:46,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:02:46,915 INFO L413 NwaCegarLoop]: 1675 mSDtfsCounter, 1143 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 13:02:46,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 2894 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 13:02:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2022-07-20 13:02:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 1394. [2022-07-20 13:02:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 847 states have (on average 1.9421487603305785) internal successors, (1645), 1385 states have internal predecessors, (1645), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1677 transitions. [2022-07-20 13:02:46,957 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1677 transitions. Word has length 6 [2022-07-20 13:02:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:46,960 INFO L495 AbstractCegarLoop]: Abstraction has 1394 states and 1677 transitions. [2022-07-20 13:02:46,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1677 transitions. [2022-07-20 13:02:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 13:02:46,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:46,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:02:46,974 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-20 13:02:47,173 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-20 13:02:47,174 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-20 13:02:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:47,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302415527] [2022-07-20 13:02:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:47,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:47,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:47,177 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-20 13:02:47,179 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-20 13:02:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:47,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 13:02:47,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:47,323 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-20 13:02:47,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:47,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:47,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302415527] [2022-07-20 13:02:47,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302415527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:47,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:47,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:02:47,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903624384] [2022-07-20 13:02:47,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:47,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:02:47,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:47,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:02:47,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:02:47,326 INFO L87 Difference]: Start difference. First operand 1394 states and 1677 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-20 13:02:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:47,361 INFO L93 Difference]: Finished difference Result 1358 states and 1640 transitions. [2022-07-20 13:02:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:02:47,363 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-20 13:02:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:47,369 INFO L225 Difference]: With dead ends: 1358 [2022-07-20 13:02:47,369 INFO L226 Difference]: Without dead ends: 1358 [2022-07-20 13:02:47,370 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-20 13:02:47,370 INFO L413 NwaCegarLoop]: 1177 mSDtfsCounter, 1137 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1210 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-20 13:02:47,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1210 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:02:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-07-20 13:02:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1352. [2022-07-20 13:02:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 829 states have (on average 1.9324487334137515) internal successors, (1602), 1343 states have internal predecessors, (1602), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1634 transitions. [2022-07-20 13:02:47,399 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1634 transitions. Word has length 11 [2022-07-20 13:02:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:47,400 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1634 transitions. [2022-07-20 13:02:47,400 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-20 13:02:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1634 transitions. [2022-07-20 13:02:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 13:02:47,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:47,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:02:47,410 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-20 13:02:47,610 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-20 13:02:47,611 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:47,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:47,611 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-20 13:02:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:47,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420124552] [2022-07-20 13:02:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:47,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:47,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:47,614 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-20 13:02:47,616 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-20 13:02:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:47,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:02:47,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:47,761 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-20 13:02:47,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:47,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:47,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420124552] [2022-07-20 13:02:47,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420124552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:47,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:47,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:02:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424977407] [2022-07-20 13:02:47,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:47,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:02:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:02:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:02:47,764 INFO L87 Difference]: Start difference. First operand 1352 states and 1634 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:47,839 INFO L93 Difference]: Finished difference Result 1337 states and 1612 transitions. [2022-07-20 13:02:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:02:47,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 13:02:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:47,845 INFO L225 Difference]: With dead ends: 1337 [2022-07-20 13:02:47,846 INFO L226 Difference]: Without dead ends: 1337 [2022-07-20 13:02:47,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:02:47,847 INFO L413 NwaCegarLoop]: 1132 mSDtfsCounter, 1108 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 2290 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-20 13:02:47,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 2290 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:02:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2022-07-20 13:02:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1330. [2022-07-20 13:02:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 821 states have (on average 1.9159561510353227) internal successors, (1573), 1321 states have internal predecessors, (1573), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1605 transitions. [2022-07-20 13:02:47,871 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1605 transitions. Word has length 13 [2022-07-20 13:02:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:47,872 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1605 transitions. [2022-07-20 13:02:47,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1605 transitions. [2022-07-20 13:02:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 13:02:47,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:47,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:02:47,886 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-20 13:02:48,079 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-20 13:02:48,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:48,080 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-20 13:02:48,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:48,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083609166] [2022-07-20 13:02:48,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:48,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:48,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:48,082 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-20 13:02:48,083 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-20 13:02:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:48,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:02:48,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:48,220 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-20 13:02:48,295 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-20 13:02:48,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:48,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:48,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083609166] [2022-07-20 13:02:48,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083609166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:48,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:48,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:02:48,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384028655] [2022-07-20 13:02:48,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:48,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:02:48,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:02:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:02:48,303 INFO L87 Difference]: Start difference. First operand 1330 states and 1605 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:50,989 INFO L93 Difference]: Finished difference Result 1791 states and 2054 transitions. [2022-07-20 13:02:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 13:02:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 13:02:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:50,995 INFO L225 Difference]: With dead ends: 1791 [2022-07-20 13:02:50,995 INFO L226 Difference]: Without dead ends: 1791 [2022-07-20 13:02:50,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:02:50,996 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 2394 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-20 13:02:50,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 1007 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-20 13:02:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2022-07-20 13:02:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1326. [2022-07-20 13:02:51,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 821 states have (on average 1.9110840438489647) internal successors, (1569), 1317 states have internal predecessors, (1569), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1601 transitions. [2022-07-20 13:02:51,022 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1601 transitions. Word has length 27 [2022-07-20 13:02:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:51,022 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 1601 transitions. [2022-07-20 13:02:51,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1601 transitions. [2022-07-20 13:02:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 13:02:51,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:51,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:02:51,033 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-20 13:02:51,233 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-20 13:02:51,233 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:51,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-20 13:02:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:51,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664552540] [2022-07-20 13:02:51,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:51,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:51,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:51,236 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-20 13:02:51,238 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-20 13:02:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:51,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 13:02:51,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:51,403 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-20 13:02:51,563 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-20 13:02:51,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:51,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:51,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664552540] [2022-07-20 13:02:51,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664552540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:51,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:51,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:02:51,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598240815] [2022-07-20 13:02:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:51,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:02:51,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:51,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:02:51,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:02:51,566 INFO L87 Difference]: Start difference. First operand 1326 states and 1601 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:54,454 INFO L93 Difference]: Finished difference Result 1510 states and 1675 transitions. [2022-07-20 13:02:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 13:02:54,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 13:02:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:54,459 INFO L225 Difference]: With dead ends: 1510 [2022-07-20 13:02:54,460 INFO L226 Difference]: Without dead ends: 1510 [2022-07-20 13:02:54,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:02:54,460 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 851 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-20 13:02:54,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1923 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-20 13:02:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-07-20 13:02:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1322. [2022-07-20 13:02:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 821 states have (on average 1.9062119366626067) internal successors, (1565), 1313 states have internal predecessors, (1565), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1597 transitions. [2022-07-20 13:02:54,492 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1597 transitions. Word has length 27 [2022-07-20 13:02:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:54,493 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1597 transitions. [2022-07-20 13:02:54,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1597 transitions. [2022-07-20 13:02:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 13:02:54,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:54,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:02:54,507 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-20 13:02:54,704 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-20 13:02:54,704 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:54,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-20 13:02:54,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:54,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543999404] [2022-07-20 13:02:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:54,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:54,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:54,707 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-20 13:02:54,708 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-20 13:02:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:54,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:02:54,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:54,959 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-20 13:02:54,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:54,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:54,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543999404] [2022-07-20 13:02:54,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543999404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:54,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:54,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:02:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433692354] [2022-07-20 13:02:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:54,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:02:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:02:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:02:54,962 INFO L87 Difference]: Start difference. First operand 1322 states and 1597 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:55,015 INFO L93 Difference]: Finished difference Result 1322 states and 1593 transitions. [2022-07-20 13:02:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:02:55,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 13:02:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:55,020 INFO L225 Difference]: With dead ends: 1322 [2022-07-20 13:02:55,021 INFO L226 Difference]: Without dead ends: 1322 [2022-07-20 13:02:55,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:02:55,023 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 1084 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 2268 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-20 13:02:55,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 2268 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:02:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2022-07-20 13:02:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1316. [2022-07-20 13:02:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 815 states have (on average 1.9079754601226995) internal successors, (1555), 1307 states have internal predecessors, (1555), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1587 transitions. [2022-07-20 13:02:55,046 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1587 transitions. Word has length 42 [2022-07-20 13:02:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:55,048 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1587 transitions. [2022-07-20 13:02:55,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1587 transitions. [2022-07-20 13:02:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 13:02:55,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:55,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:02:55,063 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-20 13:02:55,263 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-20 13:02:55,263 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:55,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:55,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-20 13:02:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:55,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101740469] [2022-07-20 13:02:55,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:55,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:55,265 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-20 13:02:55,268 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-20 13:02:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:55,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:02:55,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:55,669 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-20 13:02:55,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:55,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:55,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101740469] [2022-07-20 13:02:55,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101740469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:55,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:55,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:02:55,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852712377] [2022-07-20 13:02:55,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:55,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 13:02:55,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:55,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 13:02:55,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:02:55,671 INFO L87 Difference]: Start difference. First operand 1316 states and 1587 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:55,741 INFO L93 Difference]: Finished difference Result 1362 states and 1633 transitions. [2022-07-20 13:02:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 13:02:55,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-20 13:02:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:55,747 INFO L225 Difference]: With dead ends: 1362 [2022-07-20 13:02:55,747 INFO L226 Difference]: Without dead ends: 1362 [2022-07-20 13:02:55,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 13:02:55,748 INFO L413 NwaCegarLoop]: 1134 mSDtfsCounter, 67 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 13:02:55,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2173 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 13:02:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2022-07-20 13:02:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2022-07-20 13:02:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 861 states have (on average 1.859465737514518) internal successors, (1601), 1353 states have internal predecessors, (1601), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1633 transitions. [2022-07-20 13:02:55,774 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1633 transitions. Word has length 50 [2022-07-20 13:02:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:55,774 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 1633 transitions. [2022-07-20 13:02:55,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1633 transitions. [2022-07-20 13:02:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 13:02:55,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:55,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:02:55,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-20 13:02:55,989 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-20 13:02:55,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:55,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-20 13:02:55,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:55,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913958507] [2022-07-20 13:02:55,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:55,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:55,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:55,992 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-20 13:02:55,994 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-20 13:02:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:56,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 13:02:56,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:56,298 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-20 13:02:56,303 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-20 13:02:56,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 13:02:56,648 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-20 13:02:56,658 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:02:56,659 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-20 13:02:56,672 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-20 13:02:56,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:56,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:56,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913958507] [2022-07-20 13:02:56,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913958507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:56,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:56,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 13:02:56,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911762525] [2022-07-20 13:02:56,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:56,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:02:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:56,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:02:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:02:56,676 INFO L87 Difference]: Start difference. First operand 1362 states and 1633 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:02:58,391 INFO L93 Difference]: Finished difference Result 1331 states and 1556 transitions. [2022-07-20 13:02:58,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:02:58,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-20 13:02:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:02:58,396 INFO L225 Difference]: With dead ends: 1331 [2022-07-20 13:02:58,396 INFO L226 Difference]: Without dead ends: 1331 [2022-07-20 13:02:58,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:02:58,397 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 2001 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-20 13:02:58,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 477 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-20 13:02:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-07-20 13:02:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1112. [2022-07-20 13:02:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 695 states have (on average 1.7266187050359711) internal successors, (1200), 1103 states have internal predecessors, (1200), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:02:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1232 transitions. [2022-07-20 13:02:58,413 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1232 transitions. Word has length 53 [2022-07-20 13:02:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:02:58,413 INFO L495 AbstractCegarLoop]: Abstraction has 1112 states and 1232 transitions. [2022-07-20 13:02:58,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:02:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1232 transitions. [2022-07-20 13:02:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 13:02:58,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:02:58,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:02:58,427 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-20 13:02:58,627 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-20 13:02:58,627 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:02:58,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:02:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-20 13:02:58,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:02:58,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566990742] [2022-07-20 13:02:58,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:02:58,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:02:58,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:02:58,630 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-20 13:02:58,632 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-20 13:02:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:02:58,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 13:02:58,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:02:58,869 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-20 13:02:58,881 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-20 13:02:58,902 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-20 13:02:58,912 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-20 13:02:58,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:02:58,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:02:58,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566990742] [2022-07-20 13:02:58,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566990742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:02:58,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:02:58,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:02:58,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907771534] [2022-07-20 13:02:58,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:02:58,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 13:02:58,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:02:58,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 13:02:58,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:02:58,916 INFO L87 Difference]: Start difference. First operand 1112 states and 1232 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:03:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:03:00,941 INFO L93 Difference]: Finished difference Result 1111 states and 1231 transitions. [2022-07-20 13:03:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 13:03:00,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-20 13:03:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:03:00,944 INFO L225 Difference]: With dead ends: 1111 [2022-07-20 13:03:00,944 INFO L226 Difference]: Without dead ends: 1111 [2022-07-20 13:03:00,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 13:03:00,945 INFO L413 NwaCegarLoop]: 1046 mSDtfsCounter, 4 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:03:00,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2649 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 13:03:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-07-20 13:03:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2022-07-20 13:03:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 695 states have (on average 1.725179856115108) internal successors, (1199), 1102 states have internal predecessors, (1199), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:03:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1231 transitions. [2022-07-20 13:03:00,960 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1231 transitions. Word has length 58 [2022-07-20 13:03:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:03:00,961 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 1231 transitions. [2022-07-20 13:03:00,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:03:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1231 transitions. [2022-07-20 13:03:00,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 13:03:00,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:03:00,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:03:00,975 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-20 13:03:01,175 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-20 13:03:01,175 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:03:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:03:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-20 13:03:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:03:01,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679805577] [2022-07-20 13:03:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:03:01,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:03:01,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:03:01,178 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-20 13:03:01,179 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-20 13:03:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:03:01,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 13:03:01,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:03:01,393 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-20 13:03:01,407 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-20 13:03:01,414 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-20 13:03:01,447 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-20 13:03:01,451 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-20 13:03:01,464 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-20 13:03:01,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:03:01,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:03:01,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679805577] [2022-07-20 13:03:01,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679805577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:03:01,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:03:01,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:03:01,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753546174] [2022-07-20 13:03:01,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:03:01,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 13:03:01,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:03:01,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 13:03:01,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:03:01,466 INFO L87 Difference]: Start difference. First operand 1111 states and 1231 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:03:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:03:03,912 INFO L93 Difference]: Finished difference Result 1110 states and 1230 transitions. [2022-07-20 13:03:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 13:03:03,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-20 13:03:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:03:03,915 INFO L225 Difference]: With dead ends: 1110 [2022-07-20 13:03:03,916 INFO L226 Difference]: Without dead ends: 1110 [2022-07-20 13:03:03,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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-20 13:03:03,916 INFO L413 NwaCegarLoop]: 1046 mSDtfsCounter, 2 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 13:03:03,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2672 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 13:03:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-07-20 13:03:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2022-07-20 13:03:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 694 states have (on average 1.7262247838616716) internal successors, (1198), 1101 states have internal predecessors, (1198), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-20 13:03:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1230 transitions. [2022-07-20 13:03:03,931 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1230 transitions. Word has length 58 [2022-07-20 13:03:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:03:03,931 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1230 transitions. [2022-07-20 13:03:03,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 13:03:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1230 transitions. [2022-07-20 13:03:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-20 13:03:03,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:03:03,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:03:03,944 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-20 13:03:04,143 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-20 13:03:04,144 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:03:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:03:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2041767774, now seen corresponding path program 1 times [2022-07-20 13:03:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:03:04,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345064983] [2022-07-20 13:03:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:03:04,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:03:04,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:03:04,146 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-20 13:03:04,147 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-20 13:03:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:03:04,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 13:03:04,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:03:04,409 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-20 13:03:04,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 13:03:04,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:03:04,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345064983] [2022-07-20 13:03:04,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345064983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 13:03:04,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 13:03:04,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 13:03:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338876946] [2022-07-20 13:03:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 13:03:04,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 13:03:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:03:04,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 13:03:04,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 13:03:04,412 INFO L87 Difference]: Start difference. First operand 1110 states and 1230 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 13:03:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:03:04,454 INFO L93 Difference]: Finished difference Result 1113 states and 1235 transitions. [2022-07-20 13:03:04,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 13:03:04,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-07-20 13:03:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:03:04,459 INFO L225 Difference]: With dead ends: 1113 [2022-07-20 13:03:04,459 INFO L226 Difference]: Without dead ends: 1113 [2022-07-20 13:03:04,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 13:03:04,460 INFO L413 NwaCegarLoop]: 1045 mSDtfsCounter, 2 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 13:03:04,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3127 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 13:03:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2022-07-20 13:03:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2022-07-20 13:03:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 696 states have (on average 1.7255747126436782) internal successors, (1201), 1104 states have internal predecessors, (1201), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-20 13:03:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1235 transitions. [2022-07-20 13:03:04,476 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1235 transitions. Word has length 66 [2022-07-20 13:03:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:03:04,476 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1235 transitions. [2022-07-20 13:03:04,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 13:03:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1235 transitions. [2022-07-20 13:03:04,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-20 13:03:04,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:03:04,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:03:04,493 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-20 13:03:04,690 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-20 13:03:04,690 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:03:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:03:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash -326306715, now seen corresponding path program 1 times [2022-07-20 13:03:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:03:04,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129636835] [2022-07-20 13:03:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:03:04,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:03:04,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:03:04,692 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-20 13:03:04,693 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-20 13:03:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:03:04,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 13:03:04,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:03:04,977 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-20 13:03:04,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:03:05,060 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-20 13:03:05,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:03:05,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129636835] [2022-07-20 13:03:05,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129636835] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:03:05,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:03:05,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 13:03:05,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254325834] [2022-07-20 13:03:05,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:03:05,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 13:03:05,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:03:05,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 13:03:05,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 13:03:05,062 INFO L87 Difference]: Start difference. First operand 1113 states and 1235 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:03:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:03:05,260 INFO L93 Difference]: Finished difference Result 1125 states and 1253 transitions. [2022-07-20 13:03:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 13:03:05,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-20 13:03:05,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:03:05,265 INFO L225 Difference]: With dead ends: 1125 [2022-07-20 13:03:05,265 INFO L226 Difference]: Without dead ends: 1125 [2022-07-20 13:03:05,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-20 13:03:05,266 INFO L413 NwaCegarLoop]: 1045 mSDtfsCounter, 23 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3129 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 13:03:05,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3129 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 13:03:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-07-20 13:03:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2022-07-20 13:03:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 705 states have (on average 1.724822695035461) internal successors, (1216), 1113 states have internal predecessors, (1216), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-20 13:03:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1250 transitions. [2022-07-20 13:03:05,292 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1250 transitions. Word has length 67 [2022-07-20 13:03:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:03:05,293 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1250 transitions. [2022-07-20 13:03:05,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:03:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1250 transitions. [2022-07-20 13:03:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 13:03:05,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:03:05,294 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:03:05,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-20 13:03:05,506 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-20 13:03:05,507 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:03:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:03:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1716613406, now seen corresponding path program 2 times [2022-07-20 13:03:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:03:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402042516] [2022-07-20 13:03:05,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 13:03:05,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:03:05,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:03:05,509 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-20 13:03:05,510 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-20 13:03:05,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 13:03:05,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:03:05,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 13:03:05,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:03:05,896 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-20 13:03:05,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:03:06,041 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-20 13:03:06,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:03:06,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402042516] [2022-07-20 13:03:06,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402042516] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:03:06,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:03:06,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-20 13:03:06,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958812132] [2022-07-20 13:03:06,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:03:06,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 13:03:06,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:03:06,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 13:03:06,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-20 13:03:06,043 INFO L87 Difference]: Start difference. First operand 1123 states and 1250 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:03:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:03:06,646 INFO L93 Difference]: Finished difference Result 1144 states and 1282 transitions. [2022-07-20 13:03:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 13:03:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-20 13:03:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:03:06,651 INFO L225 Difference]: With dead ends: 1144 [2022-07-20 13:03:06,651 INFO L226 Difference]: Without dead ends: 1140 [2022-07-20 13:03:06,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 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-20 13:03:06,652 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 73 mSDsluCounter, 6256 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 7304 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 13:03:06,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 7304 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 13:03:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-07-20 13:03:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1132. [2022-07-20 13:03:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 714 states have (on average 1.719887955182073) internal successors, (1228), 1122 states have internal predecessors, (1228), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-20 13:03:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1262 transitions. [2022-07-20 13:03:06,669 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1262 transitions. Word has length 70 [2022-07-20 13:03:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:03:06,670 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1262 transitions. [2022-07-20 13:03:06,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:03:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1262 transitions. [2022-07-20 13:03:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 13:03:06,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:03:06,671 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:03:06,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-20 13:03:06,875 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-20 13:03:06,875 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:03:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:03:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1956109246, now seen corresponding path program 3 times [2022-07-20 13:03:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:03:06,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316307801] [2022-07-20 13:03:06,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 13:03:06,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:03:06,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:03:06,878 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-20 13:03:06,879 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-20 13:03:07,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 13:03:07,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:03:07,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 13:03:07,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:03:07,591 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-20 13:03:07,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:03:08,261 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-20 13:03:08,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:03:08,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316307801] [2022-07-20 13:03:08,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316307801] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:03:08,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:03:08,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-20 13:03:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898661237] [2022-07-20 13:03:08,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:03:08,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 13:03:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:03:08,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 13:03:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-20 13:03:08,264 INFO L87 Difference]: Start difference. First operand 1132 states and 1262 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:03:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:03:10,984 INFO L93 Difference]: Finished difference Result 1174 states and 1338 transitions. [2022-07-20 13:03:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-20 13:03:10,985 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-20 13:03:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:03:10,989 INFO L225 Difference]: With dead ends: 1174 [2022-07-20 13:03:10,989 INFO L226 Difference]: Without dead ends: 1168 [2022-07-20 13:03:10,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 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-20 13:03:10,991 INFO L413 NwaCegarLoop]: 1052 mSDtfsCounter, 147 mSDsluCounter, 11516 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 12568 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 13:03:10,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 12568 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 13:03:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-07-20 13:03:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1150. [2022-07-20 13:03:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 732 states have (on average 1.709016393442623) internal successors, (1251), 1140 states have internal predecessors, (1251), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-20 13:03:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1285 transitions. [2022-07-20 13:03:11,013 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1285 transitions. Word has length 76 [2022-07-20 13:03:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:03:11,013 INFO L495 AbstractCegarLoop]: Abstraction has 1150 states and 1285 transitions. [2022-07-20 13:03:11,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:03:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1285 transitions. [2022-07-20 13:03:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 13:03:11,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:03:11,014 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:03:11,031 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-20 13:03:11,229 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-20 13:03:11,229 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:03:11,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:03:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1029224194, now seen corresponding path program 4 times [2022-07-20 13:03:11,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:03:11,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839033079] [2022-07-20 13:03:11,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 13:03:11,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:03:11,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:03:11,232 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-20 13:03:11,232 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-20 13:03:11,526 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 13:03:11,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:03:11,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 13:03:11,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:03:11,847 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-20 13:03:11,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:03:13,157 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-20 13:03:13,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:03:13,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839033079] [2022-07-20 13:03:13,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839033079] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 13:03:13,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:03:13,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-20 13:03:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599575349] [2022-07-20 13:03:13,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:03:13,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 13:03:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:03:13,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 13:03:13,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-20 13:03:13,161 INFO L87 Difference]: Start difference. First operand 1150 states and 1285 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:03:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:03:23,047 INFO L93 Difference]: Finished difference Result 1230 states and 1418 transitions. [2022-07-20 13:03:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-20 13:03:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-20 13:03:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:03:23,051 INFO L225 Difference]: With dead ends: 1230 [2022-07-20 13:03:23,052 INFO L226 Difference]: Without dead ends: 1226 [2022-07-20 13:03:23,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-20 13:03:23,055 INFO L413 NwaCegarLoop]: 1065 mSDtfsCounter, 442 mSDsluCounter, 26459 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 27524 SdHoareTripleChecker+Invalid, 3575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-20 13:03:23,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 27524 Invalid, 3575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 3101 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-20 13:03:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-07-20 13:03:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1184. [2022-07-20 13:03:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 766 states have (on average 1.6932114882506528) internal successors, (1297), 1174 states have internal predecessors, (1297), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-20 13:03:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1331 transitions. [2022-07-20 13:03:23,074 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1331 transitions. Word has length 88 [2022-07-20 13:03:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:03:23,074 INFO L495 AbstractCegarLoop]: Abstraction has 1184 states and 1331 transitions. [2022-07-20 13:03:23,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 13:03:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1331 transitions. [2022-07-20 13:03:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-20 13:03:23,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:03:23,075 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:03:23,090 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-20 13:03:23,290 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-20 13:03:23,290 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:03:23,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:03:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1185723038, now seen corresponding path program 5 times [2022-07-20 13:03:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:03:23,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586948049] [2022-07-20 13:03:23,291 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 13:03:23,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:03:23,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:03:23,293 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-20 13:03:23,295 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-20 13:03:24,478 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-20 13:03:24,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:03:24,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-20 13:03:24,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:03:24,534 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 13:03:24,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-20 13:03:24,804 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 13:03:24,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-20 13:03:24,875 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-20 13:03:24,994 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 43 treesize of output 25 [2022-07-20 13:03:25,131 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1562) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:03:25,146 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1563)))) is different from true [2022-07-20 13:03:25,602 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1578)))) is different from true [2022-07-20 13:03:26,489 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:03:26,489 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 55 treesize of output 54 [2022-07-20 13:03:26,533 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 52 treesize of output 28 [2022-07-20 13:03:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-07-20 13:03:26,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:03:26,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:03:26,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586948049] [2022-07-20 13:03:26,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586948049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:03:26,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1824379704] [2022-07-20 13:03:26,867 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 13:03:26,867 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 13:03:26,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 13:03:26,871 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 13:03:26,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-20 13:04:51,985 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-20 13:04:51,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:04:52,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 13:04:52,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:04:52,271 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 13:04:52,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-20 13:04:52,463 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 13:04:52,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 41 [2022-07-20 13:04:52,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 13:04:52,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-20 13:04:55,276 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:04:55,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-20 13:04:55,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-07-20 13:04:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-20 13:04:55,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:04:55,592 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2097) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-20 13:04:55,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1824379704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:04:55,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:04:55,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 19 [2022-07-20 13:04:55,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469115794] [2022-07-20 13:04:55,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:04:55,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 13:04:55,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:04:55,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 13:04:55,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=336, Unknown=30, NotChecked=164, Total=600 [2022-07-20 13:04:55,596 INFO L87 Difference]: Start difference. First operand 1184 states and 1331 transitions. Second operand has 21 states, 18 states have (on average 7.555555555555555) internal successors, (136), 20 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 13:05:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:05:03,933 INFO L93 Difference]: Finished difference Result 2117 states and 2327 transitions. [2022-07-20 13:05:03,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 13:05:03,934 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.555555555555555) internal successors, (136), 20 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-07-20 13:05:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:05:03,939 INFO L225 Difference]: With dead ends: 2117 [2022-07-20 13:05:03,939 INFO L226 Difference]: Without dead ends: 2113 [2022-07-20 13:05:03,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 118 SyntacticMatches, 89 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=187, Invalid=831, Unknown=54, NotChecked=260, Total=1332 [2022-07-20 13:05:03,940 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 1838 mSDsluCounter, 6458 mSDsCounter, 0 mSdLazyCounter, 5624 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 7070 SdHoareTripleChecker+Invalid, 12484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 5624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6807 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-20 13:05:03,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 7070 Invalid, 12484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 5624 Invalid, 0 Unknown, 6807 Unchecked, 7.6s Time] [2022-07-20 13:05:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2022-07-20 13:05:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1546. [2022-07-20 13:05:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1126 states have (on average 1.6580817051509769) internal successors, (1867), 1531 states have internal predecessors, (1867), 20 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (22), 11 states have call predecessors, (22), 20 states have call successors, (22) [2022-07-20 13:05:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1909 transitions. [2022-07-20 13:05:03,968 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1909 transitions. Word has length 110 [2022-07-20 13:05:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:05:03,969 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 1909 transitions. [2022-07-20 13:05:03,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.555555555555555) internal successors, (136), 20 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 13:05:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1909 transitions. [2022-07-20 13:05:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-20 13:05:03,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:05:03,970 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 13:05:03,995 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-20 13:05:04,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2022-07-20 13:05:04,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 13:05:04,390 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-20 13:05:04,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:05:04,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1185723039, now seen corresponding path program 1 times [2022-07-20 13:05:04,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:05:04,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338379637] [2022-07-20 13:05:04,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:05:04,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:05:04,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:05:04,393 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-20 13:05:04,394 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-20 13:05:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:05:05,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-20 13:05:05,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:05:05,164 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-20 13:05:05,356 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:05:05,357 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-20 13:05:05,364 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-20 13:05:05,379 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-20 13:05:05,388 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-20 13:05:05,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-20 13:05:05,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 13:05:05,575 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461)))) is different from true [2022-07-20 13:05:05,636 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (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)))) is different from true [2022-07-20 13:05:05,647 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:05:05,658 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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|))) is different from true [2022-07-20 13:05:05,724 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476)))) is different from true [2022-07-20 13:05:05,763 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (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-20 13:05:05,829 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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)))) is different from true [2022-07-20 13:05:05,840 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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)))) is different from true [2022-07-20 13:05:05,906 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494)))) is different from true [2022-07-20 13:05:05,925 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:05:05,960 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-07-20 13:05:05,967 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-20 13:05:06,037 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-07-20 13:05:06,067 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:05:06,093 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-07-20 13:05:06,111 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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)))) is different from true [2022-07-20 13:05:06,125 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:05:06,137 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (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)))) is different from true [2022-07-20 13:05:06,146 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:05:06,183 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530)))) is different from true [2022-07-20 13:05:06,192 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532))) (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-20 13:05:06,201 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-20 13:05:06,266 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541))) (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|))) is different from true [2022-07-20 13:05:06,328 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:05:06,329 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-20 13:05:06,335 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-20 13:05:06,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 13:05:06,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 13:05:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 759 not checked. [2022-07-20 13:05:06,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:05:07,143 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |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 (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-20 13:05:07,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:05:07,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338379637] [2022-07-20 13:05:07,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338379637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:05:07,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [241031139] [2022-07-20 13:05:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:05:07,150 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 13:05:07,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 13:05:07,152 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 13:05:07,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process