./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 13:32:10,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 13:32:10,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 13:32:10,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 13:32:10,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 13:32:10,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 13:32:10,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 13:32:10,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 13:32:10,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 13:32:10,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 13:32:10,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 13:32:10,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 13:32:10,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 13:32:10,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 13:32:10,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 13:32:10,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 13:32:10,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 13:32:10,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 13:32:10,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 13:32:10,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 13:32:10,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 13:32:10,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 13:32:10,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 13:32:10,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 13:32:10,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 13:32:10,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 13:32:10,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 13:32:10,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 13:32:10,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 13:32:10,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 13:32:10,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 13:32:10,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 13:32:10,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 13:32:10,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 13:32:10,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 13:32:10,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 13:32:10,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 13:32:10,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 13:32:10,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 13:32:10,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 13:32:10,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 13:32:10,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-19 13:32:10,163 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 13:32:10,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 13:32:10,164 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 13:32:10,164 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 13:32:10,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 13:32:10,165 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 13:32:10,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 13:32:10,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 13:32:10,166 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 13:32:10,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 13:32:10,167 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 13:32:10,168 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 13:32:10,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 13:32:10,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 13:32:10,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 13:32:10,168 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 13:32:10,168 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 13:32:10,169 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 13:32:10,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 13:32:10,169 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 13:32:10,169 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 13:32:10,169 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 13:32:10,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 13:32:10,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 13:32:10,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 13:32:10,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:32:10,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 13:32:10,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 13:32:10,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 13:32:10,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-19 13:32:10,171 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 13:32:10,171 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 -> bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da [2021-12-19 13:32:10,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 13:32:10,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 13:32:10,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 13:32:10,424 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 13:32:10,431 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 13:32:10,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2021-12-19 13:32:10,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d8d2a98/0fbfe41b59cb4a7bac9f363ad2175ec1/FLAG3f8a25405 [2021-12-19 13:32:11,011 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 13:32:11,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2021-12-19 13:32:11,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d8d2a98/0fbfe41b59cb4a7bac9f363ad2175ec1/FLAG3f8a25405 [2021-12-19 13:32:11,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d8d2a98/0fbfe41b59cb4a7bac9f363ad2175ec1 [2021-12-19 13:32:11,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 13:32:11,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 13:32:11,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 13:32:11,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 13:32:11,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 13:32:11,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:32:11" (1/1) ... [2021-12-19 13:32:11,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693c9ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:11, skipping insertion in model container [2021-12-19 13:32:11,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:32:11" (1/1) ... [2021-12-19 13:32:11,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 13:32:11,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:32:11,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44118,44131] [2021-12-19 13:32:11,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44660,44673] [2021-12-19 13:32:12,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56247,56260] [2021-12-19 13:32:12,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56368,56381] [2021-12-19 13:32:12,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:32:12,073 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-19 13:32:12,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25ad0e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:12, skipping insertion in model container [2021-12-19 13:32:12,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 13:32:12,074 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-19 13:32:12,076 INFO L158 Benchmark]: Toolchain (without parser) took 560.26ms. Allocated memory is still 98.6MB. Free memory was 65.8MB in the beginning and 60.1MB in the end (delta: 5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 13:32:12,076 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory was 55.7MB in the beginning and 55.6MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 13:32:12,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.17ms. Allocated memory is still 98.6MB. Free memory was 65.5MB in the beginning and 60.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-19 13:32:12,079 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory was 55.7MB in the beginning and 55.6MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.17ms. Allocated memory is still 98.6MB. Free memory was 65.5MB in the beginning and 60.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 13:32:13,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 13:32:13,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 13:32:13,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 13:32:13,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 13:32:13,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 13:32:13,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 13:32:13,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 13:32:13,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 13:32:13,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 13:32:13,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 13:32:13,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 13:32:13,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 13:32:13,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 13:32:13,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 13:32:13,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 13:32:13,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 13:32:13,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 13:32:13,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 13:32:13,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 13:32:13,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 13:32:13,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 13:32:13,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 13:32:13,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 13:32:13,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 13:32:13,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 13:32:13,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 13:32:13,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 13:32:13,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 13:32:13,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 13:32:13,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 13:32:13,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 13:32:13,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 13:32:13,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 13:32:13,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 13:32:13,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 13:32:13,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 13:32:13,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 13:32:13,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 13:32:13,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 13:32:13,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 13:32:13,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-19 13:32:13,929 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 13:32:13,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 13:32:13,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 13:32:13,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 13:32:13,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 13:32:13,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 13:32:13,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 13:32:13,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 13:32:13,934 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 13:32:13,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 13:32:13,934 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 13:32:13,935 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 13:32:13,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 13:32:13,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 13:32:13,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 13:32:13,935 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 13:32:13,936 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 13:32:13,936 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 13:32:13,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 13:32:13,936 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 13:32:13,936 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-19 13:32:13,937 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-19 13:32:13,937 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 13:32:13,937 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 13:32:13,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 13:32:13,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 13:32:13,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 13:32:13,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:32:13,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 13:32:13,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 13:32:13,938 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-19 13:32:13,939 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-19 13:32:13,939 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 13:32:13,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-19 13:32:13,939 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 -> bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da [2021-12-19 13:32:14,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 13:32:14,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 13:32:14,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 13:32:14,266 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 13:32:14,267 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 13:32:14,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2021-12-19 13:32:14,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f9af923/5022714d3eda45ccadad1185ac275cfc/FLAGa1c49271d [2021-12-19 13:32:14,848 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 13:32:14,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2021-12-19 13:32:14,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f9af923/5022714d3eda45ccadad1185ac275cfc/FLAGa1c49271d [2021-12-19 13:32:15,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f9af923/5022714d3eda45ccadad1185ac275cfc [2021-12-19 13:32:15,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 13:32:15,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 13:32:15,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 13:32:15,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 13:32:15,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 13:32:15,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:32:15" (1/1) ... [2021-12-19 13:32:15,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b8a8cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:15, skipping insertion in model container [2021-12-19 13:32:15,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:32:15" (1/1) ... [2021-12-19 13:32:15,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 13:32:15,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:32:15,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44118,44131] [2021-12-19 13:32:15,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44660,44673] [2021-12-19 13:32:15,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56247,56260] [2021-12-19 13:32:15,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56368,56381] [2021-12-19 13:32:15,718 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:32:15,728 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-19 13:32:15,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:32:15,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44118,44131] [2021-12-19 13:32:15,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44660,44673] [2021-12-19 13:32:15,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56247,56260] [2021-12-19 13:32:15,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56368,56381] [2021-12-19 13:32:15,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:32:15,857 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 13:32:15,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44118,44131] [2021-12-19 13:32:15,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44660,44673] [2021-12-19 13:32:15,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56247,56260] [2021-12-19 13:32:15,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56368,56381] [2021-12-19 13:32:15,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:32:16,046 INFO L208 MainTranslator]: Completed translation [2021-12-19 13:32:16,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16 WrapperNode [2021-12-19 13:32:16,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 13:32:16,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 13:32:16,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 13:32:16,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 13:32:16,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (1/1) ... [2021-12-19 13:32:16,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (1/1) ... [2021-12-19 13:32:16,201 INFO L137 Inliner]: procedures = 285, calls = 347, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1204 [2021-12-19 13:32:16,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 13:32:16,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 13:32:16,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 13:32:16,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 13:32:16,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (1/1) ... [2021-12-19 13:32:16,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (1/1) ... [2021-12-19 13:32:16,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (1/1) ... [2021-12-19 13:32:16,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (1/1) ... [2021-12-19 13:32:16,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (1/1) ... [2021-12-19 13:32:16,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (1/1) ... [2021-12-19 13:32:16,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (1/1) ... [2021-12-19 13:32:16,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 13:32:16,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 13:32:16,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 13:32:16,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 13:32:16,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (1/1) ... [2021-12-19 13:32:16,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:32:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 13:32:16,365 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) [2021-12-19 13:32:16,389 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 [2021-12-19 13:32:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-19 13:32:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-19 13:32:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 13:32:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-19 13:32:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-19 13:32:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 13:32:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-19 13:32:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-19 13:32:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2021-12-19 13:32:16,406 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2021-12-19 13:32:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-19 13:32:16,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-19 13:32:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-19 13:32:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 13:32:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2021-12-19 13:32:16,407 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2021-12-19 13:32:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-19 13:32:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2021-12-19 13:32:16,407 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2021-12-19 13:32:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 13:32:16,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 13:32:16,708 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 13:32:16,710 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 13:32:20,518 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 13:32:20,552 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 13:32:20,552 INFO L301 CfgBuilder]: Removed 72 assume(true) statements. [2021-12-19 13:32:20,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:32:20 BoogieIcfgContainer [2021-12-19 13:32:20,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 13:32:20,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-19 13:32:20,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-19 13:32:20,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-19 13:32:20,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:32:15" (1/3) ... [2021-12-19 13:32:20,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52867e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:32:20, skipping insertion in model container [2021-12-19 13:32:20,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:32:16" (2/3) ... [2021-12-19 13:32:20,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52867e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:32:20, skipping insertion in model container [2021-12-19 13:32:20,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:32:20" (3/3) ... [2021-12-19 13:32:20,562 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-2.i [2021-12-19 13:32:20,566 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-19 13:32:20,566 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2021-12-19 13:32:20,605 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-19 13:32:20,612 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-19 13:32:20,613 INFO L340 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2021-12-19 13:32:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 1280 states, 626 states have (on average 2.2444089456869007) internal successors, (1405), 1260 states have internal predecessors, (1405), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-19 13:32:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 13:32:20,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:20,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 13:32:20,652 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:20,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:20,657 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2021-12-19 13:32:20,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:20,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953251780] [2021-12-19 13:32:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:20,667 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:20,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:20,669 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) [2021-12-19 13:32:20,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-19 13:32:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:20,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:32:20,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:20,882 INFO L388 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 [2021-12-19 13:32:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:20,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:20,909 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:20,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953251780] [2021-12-19 13:32:20,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953251780] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:20,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:20,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:32:20,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993499697] [2021-12-19 13:32:20,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:20,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:32:20,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:32:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:32:20,970 INFO L87 Difference]: Start difference. First operand has 1280 states, 626 states have (on average 2.2444089456869007) internal successors, (1405), 1260 states have internal predecessors, (1405), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:22,853 INFO L93 Difference]: Finished difference Result 1537 states and 1627 transitions. [2021-12-19 13:32:22,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:32:22,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-19 13:32:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:22,871 INFO L225 Difference]: With dead ends: 1537 [2021-12-19 13:32:22,871 INFO L226 Difference]: Without dead ends: 1535 [2021-12-19 13:32:22,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:32:22,876 INFO L933 BasicCegarLoop]: 911 mSDtfsCounter, 906 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:22,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [909 Valid, 1258 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-19 13:32:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2021-12-19 13:32:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1300. [2021-12-19 13:32:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 660 states have (on average 2.106060606060606) internal successors, (1390), 1281 states have internal predecessors, (1390), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 13:32:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1420 transitions. [2021-12-19 13:32:22,962 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1420 transitions. Word has length 3 [2021-12-19 13:32:22,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:22,963 INFO L470 AbstractCegarLoop]: Abstraction has 1300 states and 1420 transitions. [2021-12-19 13:32:22,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1420 transitions. [2021-12-19 13:32:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 13:32:22,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:22,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 13:32:22,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:23,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:23,172 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2021-12-19 13:32:23,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:23,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259447840] [2021-12-19 13:32:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:23,175 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:23,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:23,176 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) [2021-12-19 13:32:23,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-19 13:32:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:23,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 13:32:23,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:23,317 INFO L388 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 [2021-12-19 13:32:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:23,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:23,327 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:23,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259447840] [2021-12-19 13:32:23,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259447840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:23,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:23,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:32:23,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726413684] [2021-12-19 13:32:23,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:23,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:32:23,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:32:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:32:23,330 INFO L87 Difference]: Start difference. First operand 1300 states and 1420 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:26,004 INFO L93 Difference]: Finished difference Result 1891 states and 2058 transitions. [2021-12-19 13:32:26,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:32:26,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-19 13:32:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:26,012 INFO L225 Difference]: With dead ends: 1891 [2021-12-19 13:32:26,012 INFO L226 Difference]: Without dead ends: 1891 [2021-12-19 13:32:26,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:32:26,013 INFO L933 BasicCegarLoop]: 1055 mSDtfsCounter, 624 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:26,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 1758 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-12-19 13:32:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2021-12-19 13:32:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1504. [2021-12-19 13:32:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 863 states have (on average 2.0880648899188876) internal successors, (1802), 1483 states have internal predecessors, (1802), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 13:32:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1836 transitions. [2021-12-19 13:32:26,054 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1836 transitions. Word has length 3 [2021-12-19 13:32:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:26,054 INFO L470 AbstractCegarLoop]: Abstraction has 1504 states and 1836 transitions. [2021-12-19 13:32:26,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1836 transitions. [2021-12-19 13:32:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-19 13:32:26,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:26,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:32:26,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:26,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:26,265 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2021-12-19 13:32:26,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:26,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733222832] [2021-12-19 13:32:26,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:26,271 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:26,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:26,272 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) [2021-12-19 13:32:26,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-19 13:32:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:26,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:32:26,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:26,430 INFO L388 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 [2021-12-19 13:32:26,435 INFO L388 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 [2021-12-19 13:32:26,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:32:26,498 INFO L388 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 [2021-12-19 13:32:26,507 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:32:26,508 INFO L388 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 14 treesize of output 14 [2021-12-19 13:32:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:26,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:26,536 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:26,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733222832] [2021-12-19 13:32:26,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733222832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:26,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:26,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:32:26,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54787169] [2021-12-19 13:32:26,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:26,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:32:26,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:26,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:32:26,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:32:26,539 INFO L87 Difference]: Start difference. First operand 1504 states and 1836 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:30,293 INFO L93 Difference]: Finished difference Result 2569 states and 2979 transitions. [2021-12-19 13:32:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:32:30,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-19 13:32:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:30,303 INFO L225 Difference]: With dead ends: 2569 [2021-12-19 13:32:30,303 INFO L226 Difference]: Without dead ends: 2569 [2021-12-19 13:32:30,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:32:30,312 INFO L933 BasicCegarLoop]: 718 mSDtfsCounter, 2002 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:30,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2008 Valid, 1477 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-12-19 13:32:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2021-12-19 13:32:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 1649. [2021-12-19 13:32:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1008 states have (on average 2.068452380952381) internal successors, (2085), 1628 states have internal predecessors, (2085), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 13:32:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2119 transitions. [2021-12-19 13:32:30,347 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2119 transitions. Word has length 8 [2021-12-19 13:32:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:30,347 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2119 transitions. [2021-12-19 13:32:30,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2119 transitions. [2021-12-19 13:32:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-19 13:32:30,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:30,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:32:30,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:30,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:30,558 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:30,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2021-12-19 13:32:30,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:30,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469088319] [2021-12-19 13:32:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:30,559 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:30,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:30,561 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) [2021-12-19 13:32:30,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-19 13:32:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:30,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 13:32:30,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:30,706 INFO L388 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 [2021-12-19 13:32:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:30,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:30,721 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:30,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469088319] [2021-12-19 13:32:30,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469088319] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:30,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:30,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:32:30,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507509292] [2021-12-19 13:32:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:30,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:32:30,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:30,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:32:30,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:32:30,724 INFO L87 Difference]: Start difference. First operand 1649 states and 2119 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 13:32:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:33,508 INFO L93 Difference]: Finished difference Result 2811 states and 3512 transitions. [2021-12-19 13:32:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:32:33,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-12-19 13:32:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:33,522 INFO L225 Difference]: With dead ends: 2811 [2021-12-19 13:32:33,523 INFO L226 Difference]: Without dead ends: 2811 [2021-12-19 13:32:33,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:32:33,524 INFO L933 BasicCegarLoop]: 1321 mSDtfsCounter, 2333 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:33,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2339 Valid, 2579 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-19 13:32:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2021-12-19 13:32:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 1604. [2021-12-19 13:32:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1008 states have (on average 2.009920634920635) internal successors, (2026), 1583 states have internal predecessors, (2026), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 13:32:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2060 transitions. [2021-12-19 13:32:33,557 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2060 transitions. Word has length 9 [2021-12-19 13:32:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:33,557 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2060 transitions. [2021-12-19 13:32:33,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 13:32:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2060 transitions. [2021-12-19 13:32:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-19 13:32:33,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:33,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:32:33,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:33,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:33,770 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2021-12-19 13:32:33,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:33,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792271626] [2021-12-19 13:32:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:33,771 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:33,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:33,772 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) [2021-12-19 13:32:33,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-19 13:32:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:33,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:32:33,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:33,918 INFO L388 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 [2021-12-19 13:32:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:33,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:33,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:33,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792271626] [2021-12-19 13:32:33,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792271626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:33,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:33,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:32:33,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014737854] [2021-12-19 13:32:33,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:33,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:32:33,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:33,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:32:33,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:32:33,961 INFO L87 Difference]: Start difference. First operand 1604 states and 2060 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 13:32:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:37,045 INFO L93 Difference]: Finished difference Result 2440 states and 3105 transitions. [2021-12-19 13:32:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:32:37,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-12-19 13:32:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:37,054 INFO L225 Difference]: With dead ends: 2440 [2021-12-19 13:32:37,054 INFO L226 Difference]: Without dead ends: 2440 [2021-12-19 13:32:37,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:32:37,055 INFO L933 BasicCegarLoop]: 1513 mSDtfsCounter, 1581 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:37,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1586 Valid, 2720 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-12-19 13:32:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2021-12-19 13:32:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 1594. [2021-12-19 13:32:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1008 states have (on average 1.9861111111111112) internal successors, (2002), 1573 states have internal predecessors, (2002), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 13:32:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2036 transitions. [2021-12-19 13:32:37,085 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2036 transitions. Word has length 9 [2021-12-19 13:32:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:37,086 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 2036 transitions. [2021-12-19 13:32:37,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 13:32:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2036 transitions. [2021-12-19 13:32:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-19 13:32:37,087 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:37,087 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:32:37,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:37,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:37,299 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash -856298529, now seen corresponding path program 1 times [2021-12-19 13:32:37,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:37,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680854154] [2021-12-19 13:32:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:37,301 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:37,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:37,302 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) [2021-12-19 13:32:37,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-19 13:32:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:37,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:32:37,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:37,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:37,502 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:37,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680854154] [2021-12-19 13:32:37,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680854154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:37,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:37,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:32:37,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716820620] [2021-12-19 13:32:37,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:37,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:32:37,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:37,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:32:37,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:32:37,505 INFO L87 Difference]: Start difference. First operand 1594 states and 2036 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-12-19 13:32:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:38,165 INFO L93 Difference]: Finished difference Result 2264 states and 2809 transitions. [2021-12-19 13:32:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:32:38,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 [2021-12-19 13:32:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:38,172 INFO L225 Difference]: With dead ends: 2264 [2021-12-19 13:32:38,172 INFO L226 Difference]: Without dead ends: 2264 [2021-12-19 13:32:38,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:32:38,173 INFO L933 BasicCegarLoop]: 1454 mSDtfsCounter, 748 mSDsluCounter, 2419 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:38,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 3873 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-19 13:32:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2021-12-19 13:32:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1852. [2021-12-19 13:32:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1263 states have (on average 1.990498812351544) internal successors, (2514), 1828 states have internal predecessors, (2514), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-19 13:32:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2554 transitions. [2021-12-19 13:32:38,205 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2554 transitions. Word has length 11 [2021-12-19 13:32:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:38,206 INFO L470 AbstractCegarLoop]: Abstraction has 1852 states and 2554 transitions. [2021-12-19 13:32:38,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-12-19 13:32:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2554 transitions. [2021-12-19 13:32:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-19 13:32:38,207 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:38,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:32:38,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:38,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:38,417 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:38,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:38,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2126591358, now seen corresponding path program 1 times [2021-12-19 13:32:38,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:38,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540991353] [2021-12-19 13:32:38,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:38,420 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:38,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:38,422 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) [2021-12-19 13:32:38,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-19 13:32:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:38,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:32:38,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:38,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:32:38,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:32:38,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:32:38,627 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-19 13:32:38,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 36 [2021-12-19 13:32:38,678 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-19 13:32:38,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2021-12-19 13:32:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:38,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:38,701 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540991353] [2021-12-19 13:32:38,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540991353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:38,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:38,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:32:38,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931860919] [2021-12-19 13:32:38,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:38,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:32:38,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:38,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:32:38,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:32:38,702 INFO L87 Difference]: Start difference. First operand 1852 states and 2554 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:39,757 INFO L93 Difference]: Finished difference Result 2000 states and 2409 transitions. [2021-12-19 13:32:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:32:39,758 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-19 13:32:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:39,765 INFO L225 Difference]: With dead ends: 2000 [2021-12-19 13:32:39,765 INFO L226 Difference]: Without dead ends: 2000 [2021-12-19 13:32:39,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:32:39,766 INFO L933 BasicCegarLoop]: 1391 mSDtfsCounter, 501 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:39,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 3873 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-19 13:32:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2021-12-19 13:32:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1494. [2021-12-19 13:32:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 907 states have (on average 1.9757442116868797) internal successors, (1792), 1472 states have internal predecessors, (1792), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:32:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1828 transitions. [2021-12-19 13:32:39,797 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1828 transitions. Word has length 14 [2021-12-19 13:32:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:39,798 INFO L470 AbstractCegarLoop]: Abstraction has 1494 states and 1828 transitions. [2021-12-19 13:32:39,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1828 transitions. [2021-12-19 13:32:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-19 13:32:39,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:39,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:32:39,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:40,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:40,010 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:40,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:40,011 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2021-12-19 13:32:40,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:40,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170868750] [2021-12-19 13:32:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:40,012 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:40,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:40,013 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) [2021-12-19 13:32:40,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-19 13:32:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:40,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 13:32:40,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:40,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:40,192 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:40,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170868750] [2021-12-19 13:32:40,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170868750] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:40,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:40,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:32:40,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120505462] [2021-12-19 13:32:40,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:40,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:32:40,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:40,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:32:40,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:32:40,194 INFO L87 Difference]: Start difference. First operand 1494 states and 1828 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-12-19 13:32:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:40,217 INFO L93 Difference]: Finished difference Result 1434 states and 1742 transitions. [2021-12-19 13:32:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:32:40,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2021-12-19 13:32:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:40,223 INFO L225 Difference]: With dead ends: 1434 [2021-12-19 13:32:40,223 INFO L226 Difference]: Without dead ends: 1434 [2021-12-19 13:32:40,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:32:40,224 INFO L933 BasicCegarLoop]: 1239 mSDtfsCounter, 1165 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1308 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 [2021-12-19 13:32:40,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1179 Valid, 1308 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:32:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2021-12-19 13:32:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2021-12-19 13:32:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 871 states have (on average 1.9586681974741675) internal successors, (1706), 1412 states have internal predecessors, (1706), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:32:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1742 transitions. [2021-12-19 13:32:40,252 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1742 transitions. Word has length 19 [2021-12-19 13:32:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:40,253 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 1742 transitions. [2021-12-19 13:32:40,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-12-19 13:32:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1742 transitions. [2021-12-19 13:32:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-19 13:32:40,254 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:40,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:32:40,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:40,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:40,465 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2021-12-19 13:32:40,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:40,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619396106] [2021-12-19 13:32:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:40,466 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:40,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:40,467 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) [2021-12-19 13:32:40,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-19 13:32:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:40,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:32:40,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:40,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:40,683 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:40,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619396106] [2021-12-19 13:32:40,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619396106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:40,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:40,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:32:40,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891176993] [2021-12-19 13:32:40,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:40,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:32:40,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:40,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:32:40,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:32:40,686 INFO L87 Difference]: Start difference. First operand 1434 states and 1742 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-19 13:32:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:40,750 INFO L93 Difference]: Finished difference Result 1406 states and 1686 transitions. [2021-12-19 13:32:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:32:40,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2021-12-19 13:32:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:40,755 INFO L225 Difference]: With dead ends: 1406 [2021-12-19 13:32:40,755 INFO L226 Difference]: Without dead ends: 1406 [2021-12-19 13:32:40,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:32:40,757 INFO L933 BasicCegarLoop]: 1194 mSDtfsCounter, 1136 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 2450 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 [2021-12-19 13:32:40,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1150 Valid, 2450 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:32:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2021-12-19 13:32:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1404. [2021-12-19 13:32:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 855 states have (on average 1.9274853801169591) internal successors, (1648), 1382 states have internal predecessors, (1648), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:32:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1684 transitions. [2021-12-19 13:32:40,774 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1684 transitions. Word has length 21 [2021-12-19 13:32:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:40,775 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 1684 transitions. [2021-12-19 13:32:40,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-19 13:32:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1684 transitions. [2021-12-19 13:32:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-19 13:32:40,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:40,776 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:32:40,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:40,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:40,986 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:40,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2021-12-19 13:32:40,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:40,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091638676] [2021-12-19 13:32:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:40,987 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:40,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:40,988 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:32:40,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-19 13:32:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:41,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:32:41,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:41,165 INFO L388 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 [2021-12-19 13:32:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:41,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:41,243 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:41,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091638676] [2021-12-19 13:32:41,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091638676] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:41,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:41,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:32:41,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363888080] [2021-12-19 13:32:41,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:41,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:32:41,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:41,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:32:41,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:32:41,244 INFO L87 Difference]: Start difference. First operand 1404 states and 1684 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 13:32:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:44,015 INFO L93 Difference]: Finished difference Result 2572 states and 3080 transitions. [2021-12-19 13:32:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:32:44,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2021-12-19 13:32:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:44,022 INFO L225 Difference]: With dead ends: 2572 [2021-12-19 13:32:44,023 INFO L226 Difference]: Without dead ends: 2572 [2021-12-19 13:32:44,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:32:44,023 INFO L933 BasicCegarLoop]: 1149 mSDtfsCounter, 2421 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2424 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:44,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2424 Valid, 2737 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-19 13:32:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2021-12-19 13:32:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1400. [2021-12-19 13:32:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 855 states have (on average 1.9181286549707601) internal successors, (1640), 1378 states have internal predecessors, (1640), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:32:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1676 transitions. [2021-12-19 13:32:44,044 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1676 transitions. Word has length 35 [2021-12-19 13:32:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:44,044 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 1676 transitions. [2021-12-19 13:32:44,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 13:32:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1676 transitions. [2021-12-19 13:32:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-19 13:32:44,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:44,046 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:32:44,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:44,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:44,256 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2021-12-19 13:32:44,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:44,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527432142] [2021-12-19 13:32:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:44,257 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:44,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:44,259 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) [2021-12-19 13:32:44,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-19 13:32:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:44,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 13:32:44,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:44,469 INFO L388 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 [2021-12-19 13:32:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:44,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:44,675 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:44,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527432142] [2021-12-19 13:32:44,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527432142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:44,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:44,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:32:44,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013076522] [2021-12-19 13:32:44,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:44,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:32:44,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:44,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:32:44,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:32:44,676 INFO L87 Difference]: Start difference. First operand 1400 states and 1676 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 13:32:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:47,980 INFO L93 Difference]: Finished difference Result 2214 states and 2659 transitions. [2021-12-19 13:32:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 13:32:47,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2021-12-19 13:32:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:47,986 INFO L225 Difference]: With dead ends: 2214 [2021-12-19 13:32:47,987 INFO L226 Difference]: Without dead ends: 2214 [2021-12-19 13:32:47,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:32:47,988 INFO L933 BasicCegarLoop]: 1548 mSDtfsCounter, 2194 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:47,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2194 Valid, 3317 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-12-19 13:32:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2021-12-19 13:32:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1396. [2021-12-19 13:32:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 855 states have (on average 1.9087719298245613) internal successors, (1632), 1374 states have internal predecessors, (1632), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:32:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1668 transitions. [2021-12-19 13:32:48,006 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1668 transitions. Word has length 35 [2021-12-19 13:32:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:48,007 INFO L470 AbstractCegarLoop]: Abstraction has 1396 states and 1668 transitions. [2021-12-19 13:32:48,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 13:32:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1668 transitions. [2021-12-19 13:32:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-19 13:32:48,008 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:48,008 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:32:48,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:48,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:48,220 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:48,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2063645645, now seen corresponding path program 1 times [2021-12-19 13:32:48,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:48,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051700415] [2021-12-19 13:32:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:48,222 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:48,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:48,223 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) [2021-12-19 13:32:48,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-19 13:32:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:48,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:32:48,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:48,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:48,538 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:48,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051700415] [2021-12-19 13:32:48,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051700415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:48,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:48,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:32:48,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332712213] [2021-12-19 13:32:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:48,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:32:48,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:48,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:32:48,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:32:48,539 INFO L87 Difference]: Start difference. First operand 1396 states and 1668 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:48,580 INFO L93 Difference]: Finished difference Result 1384 states and 1648 transitions. [2021-12-19 13:32:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:32:48,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-12-19 13:32:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:48,584 INFO L225 Difference]: With dead ends: 1384 [2021-12-19 13:32:48,584 INFO L226 Difference]: Without dead ends: 1384 [2021-12-19 13:32:48,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:32:48,585 INFO L933 BasicCegarLoop]: 1188 mSDtfsCounter, 1112 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 2428 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 [2021-12-19 13:32:48,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1126 Valid, 2428 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:32:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2021-12-19 13:32:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2021-12-19 13:32:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 843 states have (on average 1.9122182680901543) internal successors, (1612), 1362 states have internal predecessors, (1612), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 13:32:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1648 transitions. [2021-12-19 13:32:48,611 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1648 transitions. Word has length 54 [2021-12-19 13:32:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:48,612 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 1648 transitions. [2021-12-19 13:32:48,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1648 transitions. [2021-12-19 13:32:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 13:32:48,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:48,613 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:32:48,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:48,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:48,826 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash -202859289, now seen corresponding path program 1 times [2021-12-19 13:32:48,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:48,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217968646] [2021-12-19 13:32:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:48,828 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:48,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:48,830 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) [2021-12-19 13:32:48,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-19 13:32:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:49,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 13:32:49,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:49,207 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:32:49,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2021-12-19 13:32:49,237 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-19 13:32:49,237 INFO L388 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 14 treesize of output 19 [2021-12-19 13:32:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:49,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:49,532 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:49,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217968646] [2021-12-19 13:32:49,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217968646] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:49,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:49,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:32:49,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055126342] [2021-12-19 13:32:49,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:49,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:32:49,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:49,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:32:49,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:32:49,534 INFO L87 Difference]: Start difference. First operand 1384 states and 1648 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:52,523 INFO L93 Difference]: Finished difference Result 3213 states and 3778 transitions. [2021-12-19 13:32:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:32:52,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-19 13:32:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:52,533 INFO L225 Difference]: With dead ends: 3213 [2021-12-19 13:32:52,533 INFO L226 Difference]: Without dead ends: 3213 [2021-12-19 13:32:52,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:32:52,534 INFO L933 BasicCegarLoop]: 1287 mSDtfsCounter, 1759 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:52,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1762 Valid, 2677 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-19 13:32:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2021-12-19 13:32:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 1839. [2021-12-19 13:32:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1282 states have (on average 1.8985959438377535) internal successors, (2434), 1804 states have internal predecessors, (2434), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-19 13:32:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2496 transitions. [2021-12-19 13:32:52,560 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2496 transitions. Word has length 62 [2021-12-19 13:32:52,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:52,560 INFO L470 AbstractCegarLoop]: Abstraction has 1839 states and 2496 transitions. [2021-12-19 13:32:52,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2496 transitions. [2021-12-19 13:32:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 13:32:52,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:52,561 INFO L514 BasicCegarLoop]: 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] [2021-12-19 13:32:52,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-12-19 13:32:52,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:52,775 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:52,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash -202859288, now seen corresponding path program 1 times [2021-12-19 13:32:52,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:52,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365780743] [2021-12-19 13:32:52,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:52,776 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:52,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:52,777 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) [2021-12-19 13:32:52,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-19 13:32:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:53,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 13:32:53,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:53,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:32:53,120 INFO L388 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 [2021-12-19 13:32:53,181 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:32:53,181 INFO L388 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 14 [2021-12-19 13:32:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:53,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:53,806 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:53,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365780743] [2021-12-19 13:32:53,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365780743] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:53,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:53,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:32:53,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960940908] [2021-12-19 13:32:53,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:53,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:32:53,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:53,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:32:53,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:32:53,808 INFO L87 Difference]: Start difference. First operand 1839 states and 2496 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:57,104 INFO L93 Difference]: Finished difference Result 1845 states and 2503 transitions. [2021-12-19 13:32:57,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:32:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-19 13:32:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:57,111 INFO L225 Difference]: With dead ends: 1845 [2021-12-19 13:32:57,111 INFO L226 Difference]: Without dead ends: 1845 [2021-12-19 13:32:57,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:32:57,112 INFO L933 BasicCegarLoop]: 1170 mSDtfsCounter, 111 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 3393 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:57,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 3393 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-12-19 13:32:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2021-12-19 13:32:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1844. [2021-12-19 13:32:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1286 states have (on average 1.895800933125972) internal successors, (2438), 1808 states have internal predecessors, (2438), 32 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-19 13:32:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2502 transitions. [2021-12-19 13:32:57,130 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2502 transitions. Word has length 62 [2021-12-19 13:32:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:57,130 INFO L470 AbstractCegarLoop]: Abstraction has 1844 states and 2502 transitions. [2021-12-19 13:32:57,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2502 transitions. [2021-12-19 13:32:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-19 13:32:57,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:57,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:32:57,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:57,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:57,335 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:57,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:57,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1136013504, now seen corresponding path program 1 times [2021-12-19 13:32:57,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:57,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916332737] [2021-12-19 13:32:57,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:57,336 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:57,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:57,339 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) [2021-12-19 13:32:57,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-19 13:32:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:57,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:32:57,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:57,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:57,684 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:57,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916332737] [2021-12-19 13:32:57,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916332737] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:57,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:57,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 13:32:57,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256470558] [2021-12-19 13:32:57,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:57,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:32:57,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:57,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:32:57,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:32:57,686 INFO L87 Difference]: Start difference. First operand 1844 states and 2502 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:57,762 INFO L93 Difference]: Finished difference Result 1870 states and 2529 transitions. [2021-12-19 13:32:57,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 13:32:57,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-12-19 13:32:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:57,767 INFO L225 Difference]: With dead ends: 1870 [2021-12-19 13:32:57,768 INFO L226 Difference]: Without dead ends: 1870 [2021-12-19 13:32:57,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:32:57,768 INFO L933 BasicCegarLoop]: 1185 mSDtfsCounter, 19 mSDsluCounter, 4733 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5918 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:57,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 5918 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 13:32:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2021-12-19 13:32:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1868. [2021-12-19 13:32:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1304 states have (on average 1.8872699386503067) internal successors, (2461), 1828 states have internal predecessors, (2461), 34 states have call successors, (34), 13 states have call predecessors, (34), 11 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2021-12-19 13:32:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2529 transitions. [2021-12-19 13:32:57,795 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2529 transitions. Word has length 68 [2021-12-19 13:32:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:57,796 INFO L470 AbstractCegarLoop]: Abstraction has 1868 states and 2529 transitions. [2021-12-19 13:32:57,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:32:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2529 transitions. [2021-12-19 13:32:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-19 13:32:57,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:57,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:32:57,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:57,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:57,997 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1078181117, now seen corresponding path program 1 times [2021-12-19 13:32:57,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:57,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728790925] [2021-12-19 13:32:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:57,998 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:57,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:57,999 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) [2021-12-19 13:32:58,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-19 13:32:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:58,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 13:32:58,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:58,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:58,383 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728790925] [2021-12-19 13:32:58,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728790925] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:58,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:58,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 13:32:58,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846622344] [2021-12-19 13:32:58,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:58,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:32:58,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:58,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:32:58,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:32:58,385 INFO L87 Difference]: Start difference. First operand 1868 states and 2529 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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) [2021-12-19 13:32:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:32:58,526 INFO L93 Difference]: Finished difference Result 1880 states and 2543 transitions. [2021-12-19 13:32:58,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:32:58,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2021-12-19 13:32:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:32:58,531 INFO L225 Difference]: With dead ends: 1880 [2021-12-19 13:32:58,531 INFO L226 Difference]: Without dead ends: 1880 [2021-12-19 13:32:58,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:32:58,532 INFO L933 BasicCegarLoop]: 1185 mSDtfsCounter, 23 mSDsluCounter, 3450 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4635 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:32:58,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 4635 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 13:32:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2021-12-19 13:32:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1871. [2021-12-19 13:32:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1306 states have (on average 1.8859111791730474) internal successors, (2463), 1830 states have internal predecessors, (2463), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 13:32:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2532 transitions. [2021-12-19 13:32:58,557 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2532 transitions. Word has length 68 [2021-12-19 13:32:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:32:58,558 INFO L470 AbstractCegarLoop]: Abstraction has 1871 states and 2532 transitions. [2021-12-19 13:32:58,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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) [2021-12-19 13:32:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2532 transitions. [2021-12-19 13:32:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 13:32:58,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:32:58,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:32:58,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-19 13:32:58,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:32:58,773 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:32:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:32:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash 396897840, now seen corresponding path program 1 times [2021-12-19 13:32:58,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:32:58,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739513827] [2021-12-19 13:32:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:32:58,774 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:32:58,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:32:58,775 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) [2021-12-19 13:32:58,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-19 13:32:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:32:59,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:32:59,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:32:59,129 INFO L388 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 [2021-12-19 13:32:59,319 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-19 13:32:59,319 INFO L388 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 15 treesize of output 20 [2021-12-19 13:32:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:32:59,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:32:59,330 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:32:59,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739513827] [2021-12-19 13:32:59,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739513827] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:32:59,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:32:59,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 13:32:59,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735332081] [2021-12-19 13:32:59,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:32:59,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:32:59,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:32:59,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:32:59,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:32:59,332 INFO L87 Difference]: Start difference. First operand 1871 states and 2532 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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) [2021-12-19 13:33:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:33:02,388 INFO L93 Difference]: Finished difference Result 3195 states and 4242 transitions. [2021-12-19 13:33:02,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:33:02,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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 73 [2021-12-19 13:33:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:33:02,393 INFO L225 Difference]: With dead ends: 3195 [2021-12-19 13:33:02,393 INFO L226 Difference]: Without dead ends: 3195 [2021-12-19 13:33:02,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:33:02,394 INFO L933 BasicCegarLoop]: 1114 mSDtfsCounter, 1622 mSDsluCounter, 2883 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 3997 SdHoareTripleChecker+Invalid, 3589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 841 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:33:02,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1628 Valid, 3997 Invalid, 3589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2727 Invalid, 0 Unknown, 841 Unchecked, 3.0s Time] [2021-12-19 13:33:02,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2021-12-19 13:33:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 1870. [2021-12-19 13:33:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1306 states have (on average 1.8843797856049005) internal successors, (2461), 1829 states have internal predecessors, (2461), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 13:33:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2530 transitions. [2021-12-19 13:33:02,420 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2530 transitions. Word has length 73 [2021-12-19 13:33:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:33:02,421 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2530 transitions. [2021-12-19 13:33:02,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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) [2021-12-19 13:33:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2530 transitions. [2021-12-19 13:33:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 13:33:02,422 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:33:02,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:33:02,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-19 13:33:02,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:33:02,636 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:33:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:33:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 396897841, now seen corresponding path program 1 times [2021-12-19 13:33:02,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:33:02,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361276440] [2021-12-19 13:33:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:33:02,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:33:02,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:33:02,639 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) [2021-12-19 13:33:02,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-19 13:33:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:33:02,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 13:33:02,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:33:02,980 INFO L388 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 [2021-12-19 13:33:02,985 INFO L388 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 [2021-12-19 13:33:03,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:33:03,439 INFO L388 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 [2021-12-19 13:33:03,460 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:33:03,460 INFO L388 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 14 treesize of output 14 [2021-12-19 13:33:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:03,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:33:03,479 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:33:03,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361276440] [2021-12-19 13:33:03,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361276440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:33:03,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:33:03,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 13:33:03,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167375305] [2021-12-19 13:33:03,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:33:03,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-19 13:33:03,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:33:03,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 13:33:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:33:03,482 INFO L87 Difference]: Start difference. First operand 1870 states and 2530 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2021-12-19 13:33:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:33:08,389 INFO L93 Difference]: Finished difference Result 3266 states and 4367 transitions. [2021-12-19 13:33:08,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 13:33:08,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 73 [2021-12-19 13:33:08,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:33:08,412 INFO L225 Difference]: With dead ends: 3266 [2021-12-19 13:33:08,413 INFO L226 Difference]: Without dead ends: 3266 [2021-12-19 13:33:08,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:33:08,414 INFO L933 BasicCegarLoop]: 1320 mSDtfsCounter, 2395 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 3940 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 3844 SdHoareTripleChecker+Invalid, 5280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1308 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-12-19 13:33:08,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2401 Valid, 3844 Invalid, 5280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3940 Invalid, 0 Unknown, 1308 Unchecked, 4.8s Time] [2021-12-19 13:33:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2021-12-19 13:33:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 1866. [2021-12-19 13:33:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1310 states have (on average 1.869465648854962) internal successors, (2449), 1825 states have internal predecessors, (2449), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 13:33:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2518 transitions. [2021-12-19 13:33:08,448 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2518 transitions. Word has length 73 [2021-12-19 13:33:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:33:08,449 INFO L470 AbstractCegarLoop]: Abstraction has 1866 states and 2518 transitions. [2021-12-19 13:33:08,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2021-12-19 13:33:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2518 transitions. [2021-12-19 13:33:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-19 13:33:08,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:33:08,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:33:08,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-19 13:33:08,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:33:08,667 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:33:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:33:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1622258381, now seen corresponding path program 1 times [2021-12-19 13:33:08,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:33:08,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438080212] [2021-12-19 13:33:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:33:08,668 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:33:08,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:33:08,669 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) [2021-12-19 13:33:08,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-19 13:33:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:33:08,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 13:33:08,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:33:09,037 INFO L388 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 [2021-12-19 13:33:09,051 INFO L388 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 [2021-12-19 13:33:09,078 INFO L388 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 24 treesize of output 12 [2021-12-19 13:33:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:09,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:33:09,105 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:33:09,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438080212] [2021-12-19 13:33:09,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438080212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:33:09,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:33:09,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-19 13:33:09,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677754137] [2021-12-19 13:33:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:33:09,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-19 13:33:09,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:33:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 13:33:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:33:09,106 INFO L87 Difference]: Start difference. First operand 1866 states and 2518 transitions. Second operand has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 13:33:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:33:12,037 INFO L93 Difference]: Finished difference Result 1881 states and 2534 transitions. [2021-12-19 13:33:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 13:33:12,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2021-12-19 13:33:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:33:12,040 INFO L225 Difference]: With dead ends: 1881 [2021-12-19 13:33:12,040 INFO L226 Difference]: Without dead ends: 1881 [2021-12-19 13:33:12,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-19 13:33:12,041 INFO L933 BasicCegarLoop]: 1171 mSDtfsCounter, 23 mSDsluCounter, 3760 mSDsCounter, 0 mSdLazyCounter, 3317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4931 SdHoareTripleChecker+Invalid, 3319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-19 13:33:12,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 4931 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3317 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-19 13:33:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2021-12-19 13:33:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1880. [2021-12-19 13:33:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1322 states have (on average 1.8645990922844176) internal successors, (2465), 1837 states have internal predecessors, (2465), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 13:33:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2534 transitions. [2021-12-19 13:33:12,070 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2534 transitions. Word has length 80 [2021-12-19 13:33:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:33:12,070 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2534 transitions. [2021-12-19 13:33:12,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 13:33:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2534 transitions. [2021-12-19 13:33:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-19 13:33:12,071 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:33:12,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:33:12,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-19 13:33:12,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:33:12,285 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:33:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:33:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1249597809, now seen corresponding path program 1 times [2021-12-19 13:33:12,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:33:12,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676314438] [2021-12-19 13:33:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:33:12,287 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:33:12,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:33:12,288 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:33:12,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-19 13:33:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:33:12,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-19 13:33:12,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:33:12,640 INFO L388 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 [2021-12-19 13:33:12,667 INFO L388 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 [2021-12-19 13:33:12,672 INFO L388 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 [2021-12-19 13:33:12,706 INFO L388 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 [2021-12-19 13:33:12,709 INFO L388 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 [2021-12-19 13:33:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:12,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:33:12,775 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:33:12,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676314438] [2021-12-19 13:33:12,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676314438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:33:12,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:33:12,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-19 13:33:12,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078817396] [2021-12-19 13:33:12,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:33:12,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-19 13:33:12,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:33:12,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-19 13:33:12,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-19 13:33:12,776 INFO L87 Difference]: Start difference. First operand 1880 states and 2534 transitions. Second operand has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:33:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:33:16,828 INFO L93 Difference]: Finished difference Result 1880 states and 2532 transitions. [2021-12-19 13:33:16,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 13:33:16,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2021-12-19 13:33:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:33:16,833 INFO L225 Difference]: With dead ends: 1880 [2021-12-19 13:33:16,834 INFO L226 Difference]: Without dead ends: 1880 [2021-12-19 13:33:16,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-19 13:33:16,835 INFO L933 BasicCegarLoop]: 1166 mSDtfsCounter, 19 mSDsluCounter, 4791 mSDsCounter, 0 mSdLazyCounter, 3469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5957 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:33:16,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 5957 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3469 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-12-19 13:33:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2021-12-19 13:33:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2021-12-19 13:33:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1322 states have (on average 1.8630862329803328) internal successors, (2463), 1837 states have internal predecessors, (2463), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 13:33:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2532 transitions. [2021-12-19 13:33:16,862 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2532 transitions. Word has length 81 [2021-12-19 13:33:16,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:33:16,862 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2532 transitions. [2021-12-19 13:33:16,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:33:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2532 transitions. [2021-12-19 13:33:16,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-19 13:33:16,863 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:33:16,863 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:33:16,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-19 13:33:17,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:33:17,078 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:33:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:33:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -63374884, now seen corresponding path program 1 times [2021-12-19 13:33:17,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:33:17,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138495190] [2021-12-19 13:33:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:33:17,079 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:33:17,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:33:17,081 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) [2021-12-19 13:33:17,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-19 13:33:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:33:17,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:33:17,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:33:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:17,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:33:17,468 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:33:17,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138495190] [2021-12-19 13:33:17,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138495190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:33:17,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:33:17,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 13:33:17,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570485939] [2021-12-19 13:33:17,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:33:17,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:33:17,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:33:17,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:33:17,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:33:17,470 INFO L87 Difference]: Start difference. First operand 1880 states and 2532 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-19 13:33:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:33:17,520 INFO L93 Difference]: Finished difference Result 1896 states and 2550 transitions. [2021-12-19 13:33:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:33:17,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 88 [2021-12-19 13:33:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:33:17,524 INFO L225 Difference]: With dead ends: 1896 [2021-12-19 13:33:17,524 INFO L226 Difference]: Without dead ends: 1890 [2021-12-19 13:33:17,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:33:17,527 INFO L933 BasicCegarLoop]: 1174 mSDtfsCounter, 13 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:33:17,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 3514 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:33:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2021-12-19 13:33:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2021-12-19 13:33:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1330 states have (on average 1.8593984962406016) internal successors, (2473), 1847 states have internal predecessors, (2473), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:33:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2544 transitions. [2021-12-19 13:33:17,551 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2544 transitions. Word has length 88 [2021-12-19 13:33:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:33:17,551 INFO L470 AbstractCegarLoop]: Abstraction has 1890 states and 2544 transitions. [2021-12-19 13:33:17,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-19 13:33:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2544 transitions. [2021-12-19 13:33:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-19 13:33:17,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:33:17,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:33:17,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-19 13:33:17,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:33:17,780 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:33:17,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:33:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash -407790698, now seen corresponding path program 1 times [2021-12-19 13:33:17,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:33:17,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450369635] [2021-12-19 13:33:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:33:17,781 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:33:17,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:33:17,783 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:33:17,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-19 13:33:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:33:18,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 13:33:18,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:33:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:18,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:33:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:18,455 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:33:18,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450369635] [2021-12-19 13:33:18,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450369635] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:33:18,456 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:33:18,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-19 13:33:18,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951113580] [2021-12-19 13:33:18,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:33:18,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-19 13:33:18,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:33:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 13:33:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-19 13:33:18,457 INFO L87 Difference]: Start difference. First operand 1890 states and 2544 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:33:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:33:18,631 INFO L93 Difference]: Finished difference Result 1916 states and 2574 transitions. [2021-12-19 13:33:18,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-19 13:33:18,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 89 [2021-12-19 13:33:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:33:18,636 INFO L225 Difference]: With dead ends: 1916 [2021-12-19 13:33:18,637 INFO L226 Difference]: Without dead ends: 1904 [2021-12-19 13:33:18,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2021-12-19 13:33:18,637 INFO L933 BasicCegarLoop]: 1177 mSDtfsCounter, 48 mSDsluCounter, 5851 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7028 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:33:18,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 7028 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 13:33:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2021-12-19 13:33:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1898. [2021-12-19 13:33:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1338 states have (on average 1.8557548579970105) internal successors, (2483), 1855 states have internal predecessors, (2483), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:33:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2554 transitions. [2021-12-19 13:33:18,655 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2554 transitions. Word has length 89 [2021-12-19 13:33:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:33:18,656 INFO L470 AbstractCegarLoop]: Abstraction has 1898 states and 2554 transitions. [2021-12-19 13:33:18,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:33:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2554 transitions. [2021-12-19 13:33:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-19 13:33:18,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:33:18,657 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:33:18,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-19 13:33:18,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:33:18,862 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:33:18,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:33:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1714460764, now seen corresponding path program 2 times [2021-12-19 13:33:18,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:33:18,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168647648] [2021-12-19 13:33:18,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 13:33:18,863 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:33:18,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:33:18,864 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:33:18,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-19 13:33:19,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 13:33:19,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:33:19,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 13:33:19,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:33:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:19,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:33:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:19,907 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:33:19,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168647648] [2021-12-19 13:33:19,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168647648] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:33:19,907 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:33:19,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-12-19 13:33:19,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067209828] [2021-12-19 13:33:19,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:33:19,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 13:33:19,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:33:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 13:33:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-19 13:33:19,909 INFO L87 Difference]: Start difference. First operand 1898 states and 2554 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:33:20,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:33:20,432 INFO L93 Difference]: Finished difference Result 1952 states and 2622 transitions. [2021-12-19 13:33:20,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-19 13:33:20,433 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 92 [2021-12-19 13:33:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:33:20,437 INFO L225 Difference]: With dead ends: 1952 [2021-12-19 13:33:20,437 INFO L226 Difference]: Without dead ends: 1940 [2021-12-19 13:33:20,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2021-12-19 13:33:20,438 INFO L933 BasicCegarLoop]: 1183 mSDtfsCounter, 78 mSDsluCounter, 8233 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 9416 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:33:20,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 9416 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 13:33:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2021-12-19 13:33:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1916. [2021-12-19 13:33:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1356 states have (on average 1.84882005899705) internal successors, (2507), 1873 states have internal predecessors, (2507), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:33:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2578 transitions. [2021-12-19 13:33:20,473 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2578 transitions. Word has length 92 [2021-12-19 13:33:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:33:20,473 INFO L470 AbstractCegarLoop]: Abstraction has 1916 states and 2578 transitions. [2021-12-19 13:33:20,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:33:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2578 transitions. [2021-12-19 13:33:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-19 13:33:20,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:33:20,475 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:33:20,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-19 13:33:20,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:33:20,687 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:33:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:33:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1774326244, now seen corresponding path program 3 times [2021-12-19 13:33:20,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:33:20,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073805061] [2021-12-19 13:33:20,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 13:33:20,689 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:33:20,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:33:20,690 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:33:20,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-19 13:33:21,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-19 13:33:21,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:33:21,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 13:33:21,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:33:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:21,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:33:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:22,613 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:33:22,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073805061] [2021-12-19 13:33:22,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073805061] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:33:22,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:33:22,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-12-19 13:33:22,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746775798] [2021-12-19 13:33:22,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:33:22,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-19 13:33:22,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:33:22,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-19 13:33:22,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2021-12-19 13:33:22,615 INFO L87 Difference]: Start difference. First operand 1916 states and 2578 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:33:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:33:25,275 INFO L93 Difference]: Finished difference Result 2024 states and 2726 transitions. [2021-12-19 13:33:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-19 13:33:25,275 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2021-12-19 13:33:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:33:25,278 INFO L225 Difference]: With dead ends: 2024 [2021-12-19 13:33:25,278 INFO L226 Difference]: Without dead ends: 2006 [2021-12-19 13:33:25,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=924, Invalid=1832, Unknown=0, NotChecked=0, Total=2756 [2021-12-19 13:33:25,280 INFO L933 BasicCegarLoop]: 1195 mSDtfsCounter, 215 mSDsluCounter, 15439 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 16634 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-19 13:33:25,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 16634 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-19 13:33:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2021-12-19 13:33:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1952. [2021-12-19 13:33:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1392 states have (on average 1.834051724137931) internal successors, (2553), 1909 states have internal predecessors, (2553), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:33:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2624 transitions. [2021-12-19 13:33:25,301 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2624 transitions. Word has length 98 [2021-12-19 13:33:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:33:25,302 INFO L470 AbstractCegarLoop]: Abstraction has 1952 states and 2624 transitions. [2021-12-19 13:33:25,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:33:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2624 transitions. [2021-12-19 13:33:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-19 13:33:25,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:33:25,303 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:33:25,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-19 13:33:25,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:33:25,520 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:33:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:33:25,521 INFO L85 PathProgramCache]: Analyzing trace with hash -824268388, now seen corresponding path program 4 times [2021-12-19 13:33:25,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:33:25,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8454037] [2021-12-19 13:33:25,521 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 13:33:25,522 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:33:25,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:33:25,523 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:33:25,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-19 13:33:25,973 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 13:33:25,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:33:26,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-19 13:33:26,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:33:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:26,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:33:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:33:28,175 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:33:28,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8454037] [2021-12-19 13:33:28,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8454037] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:33:28,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:33:28,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2021-12-19 13:33:28,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489225995] [2021-12-19 13:33:28,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:33:28,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-19 13:33:28,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:33:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-19 13:33:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2021-12-19 13:33:28,178 INFO L87 Difference]: Start difference. First operand 1952 states and 2624 transitions. Second operand has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:33:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:33:35,891 INFO L93 Difference]: Finished difference Result 2158 states and 2894 transitions. [2021-12-19 13:33:35,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-19 13:33:35,892 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 110 [2021-12-19 13:33:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:33:35,895 INFO L225 Difference]: With dead ends: 2158 [2021-12-19 13:33:35,895 INFO L226 Difference]: Without dead ends: 2146 [2021-12-19 13:33:35,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=4121, Invalid=9921, Unknown=0, NotChecked=0, Total=14042 [2021-12-19 13:33:35,898 INFO L933 BasicCegarLoop]: 1217 mSDtfsCounter, 497 mSDsluCounter, 33741 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 34958 SdHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-19 13:33:35,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 34958 Invalid, 3010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-12-19 13:33:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2021-12-19 13:33:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2020. [2021-12-19 13:33:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 1460 states have (on average 1.8116438356164384) internal successors, (2645), 1977 states have internal predecessors, (2645), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:33:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2716 transitions. [2021-12-19 13:33:35,919 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2716 transitions. Word has length 110 [2021-12-19 13:33:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:33:35,919 INFO L470 AbstractCegarLoop]: Abstraction has 2020 states and 2716 transitions. [2021-12-19 13:33:35,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:33:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2716 transitions. [2021-12-19 13:33:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-19 13:33:35,921 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:33:35,921 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:33:35,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-19 13:33:36,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:33:36,138 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:33:36,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:33:36,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1958349148, now seen corresponding path program 5 times [2021-12-19 13:33:36,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:33:36,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842099138] [2021-12-19 13:33:36,139 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 13:33:36,139 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:33:36,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:33:36,140 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:33:36,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-19 13:33:37,451 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 13:33:37,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:33:37,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-19 13:33:37,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:33:37,504 INFO L388 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 [2021-12-19 13:33:37,655 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:33:37,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-19 13:33:37,683 INFO L388 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 [2021-12-19 13:33:37,767 INFO L388 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 [2021-12-19 13:33:39,866 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:33:39,866 INFO L388 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 37 treesize of output 38 [2021-12-19 13:33:39,924 INFO L388 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 34 treesize of output 16 [2021-12-19 13:33:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:33:39,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:33:40,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:33:40,279 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:33:40,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842099138] [2021-12-19 13:33:40,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842099138] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:33:40,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [504220920] [2021-12-19 13:33:40,279 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 13:33:40,279 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:33:40,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:33:40,284 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:33:40,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2021-12-19 13:35:05,891 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 13:35:05,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:35:06,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 13:35:06,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:06,145 INFO L388 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 [2021-12-19 13:35:06,319 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:35:06,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-19 13:35:06,333 INFO L388 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 [2021-12-19 13:35:06,393 INFO L388 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 [2021-12-19 13:35:08,332 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:35:08,333 INFO L388 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 37 treesize of output 38 [2021-12-19 13:35:08,372 INFO L388 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 34 treesize of output 16 [2021-12-19 13:35:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:35:08,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:35:08,610 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3142) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:35:08,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [504220920] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:35:08,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:35:08,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-12-19 13:35:08,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76685434] [2021-12-19 13:35:08,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:35:08,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-19 13:35:08,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:35:08,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 13:35:08,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=191, Unknown=15, NotChecked=58, Total=306 [2021-12-19 13:35:08,612 INFO L87 Difference]: Start difference. First operand 2020 states and 2716 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:35:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:35:13,303 INFO L93 Difference]: Finished difference Result 3339 states and 4420 transitions. [2021-12-19 13:35:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-19 13:35:13,304 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 132 [2021-12-19 13:35:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:35:13,307 INFO L225 Difference]: With dead ends: 3339 [2021-12-19 13:35:13,307 INFO L226 Difference]: Without dead ends: 3339 [2021-12-19 13:35:13,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 165 SyntacticMatches, 90 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=69, Invalid=338, Unknown=21, NotChecked=78, Total=506 [2021-12-19 13:35:13,307 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 1608 mSDsluCounter, 6787 mSDsCounter, 0 mSdLazyCounter, 4570 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 7898 SdHoareTripleChecker+Invalid, 7957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3363 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2021-12-19 13:35:13,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 7898 Invalid, 7957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4570 Invalid, 0 Unknown, 3363 Unchecked, 4.5s Time] [2021-12-19 13:35:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2021-12-19 13:35:13,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2019. [2021-12-19 13:35:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 1460 states have (on average 1.8102739726027397) internal successors, (2643), 1976 states have internal predecessors, (2643), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:35:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2714 transitions. [2021-12-19 13:35:13,333 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 2714 transitions. Word has length 132 [2021-12-19 13:35:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:35:13,333 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 2714 transitions. [2021-12-19 13:35:13,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:35:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2714 transitions. [2021-12-19 13:35:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-19 13:35:13,335 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:35:13,335 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:35:13,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:13,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-19 13:35:13,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:35:13,748 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:35:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:35:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1958349149, now seen corresponding path program 1 times [2021-12-19 13:35:13,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:35:13,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868609326] [2021-12-19 13:35:13,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:13,750 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:35:13,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:35:13,752 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:35:13,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-19 13:35:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:35:14,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-19 13:35:14,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:35:14,595 INFO L388 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 [2021-12-19 13:35:14,879 INFO L388 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 [2021-12-19 13:35:14,912 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:35:14,912 INFO L388 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 14 treesize of output 14 [2021-12-19 13:35:14,938 INFO L388 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 [2021-12-19 13:35:14,942 INFO L388 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 [2021-12-19 13:35:15,031 INFO L388 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 [2021-12-19 13:35:15,034 INFO L388 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 [2021-12-19 13:35:16,663 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:35:16,663 INFO L388 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 [2021-12-19 13:35:16,667 INFO L388 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 [2021-12-19 13:35:16,714 INFO L388 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 [2021-12-19 13:35:16,717 INFO L388 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 [2021-12-19 13:35:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:35:16,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:35:17,490 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:35:17,495 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:35:17,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868609326] [2021-12-19 13:35:17,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868609326] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:35:17,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [564878026] [2021-12-19 13:35:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:35:17,496 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:35:17,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:35:17,497 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:35:17,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2021-12-19 13:38:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:38:00,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-19 13:38:00,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:38:00,799 INFO L388 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 [2021-12-19 13:38:00,998 INFO L388 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 [2021-12-19 13:38:01,027 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:38:01,028 INFO L388 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 14 treesize of output 14 [2021-12-19 13:38:01,063 INFO L388 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 [2021-12-19 13:38:01,068 INFO L388 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 [2021-12-19 13:38:01,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-19 13:38:01,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-19 13:38:02,527 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:02,527 INFO L388 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 [2021-12-19 13:38:02,531 INFO L388 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 [2021-12-19 13:38:02,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-19 13:38:02,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-19 13:38:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:38:02,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:38:03,213 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:38:03,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [564878026] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:38:03,218 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:38:03,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2021-12-19 13:38:03,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507371135] [2021-12-19 13:38:03,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:38:03,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-19 13:38:03,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:38:03,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-19 13:38:03,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=390, Unknown=19, NotChecked=82, Total=552 [2021-12-19 13:38:03,219 INFO L87 Difference]: Start difference. First operand 2019 states and 2714 transitions. Second operand has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:38:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:38:14,079 INFO L93 Difference]: Finished difference Result 3340 states and 4420 transitions. [2021-12-19 13:38:14,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-19 13:38:14,080 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 132 [2021-12-19 13:38:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:38:14,083 INFO L225 Difference]: With dead ends: 3340 [2021-12-19 13:38:14,083 INFO L226 Difference]: Without dead ends: 3340 [2021-12-19 13:38:14,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 160 SyntacticMatches, 89 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=120, Invalid=730, Unknown=28, NotChecked=114, Total=992 [2021-12-19 13:38:14,084 INFO L933 BasicCegarLoop]: 1112 mSDtfsCounter, 2171 mSDsluCounter, 7312 mSDsCounter, 0 mSdLazyCounter, 11239 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 8424 SdHoareTripleChecker+Invalid, 13865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 11239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2590 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2021-12-19 13:38:14,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2176 Valid, 8424 Invalid, 13865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 11239 Invalid, 0 Unknown, 2590 Unchecked, 10.5s Time] [2021-12-19 13:38:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2021-12-19 13:38:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 2018. [2021-12-19 13:38:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1460 states have (on average 1.808904109589041) internal successors, (2641), 1975 states have internal predecessors, (2641), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:38:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2712 transitions. [2021-12-19 13:38:14,106 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2712 transitions. Word has length 132 [2021-12-19 13:38:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:38:14,107 INFO L470 AbstractCegarLoop]: Abstraction has 2018 states and 2712 transitions. [2021-12-19 13:38:14,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:38:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2712 transitions. [2021-12-19 13:38:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-19 13:38:14,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:38:14,108 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:38:14,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2021-12-19 13:38:14,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-19 13:38:14,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:38:14,536 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:38:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:38:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1655953071, now seen corresponding path program 1 times [2021-12-19 13:38:14,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:38:14,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012266114] [2021-12-19 13:38:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:38:14,537 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:38:14,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:38:14,539 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:38:14,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-19 13:38:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:38:15,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 13:38:15,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:38:15,496 INFO L388 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 [2021-12-19 13:38:15,648 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:38:15,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-19 13:38:15,684 INFO L388 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 [2021-12-19 13:38:15,774 INFO L388 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 [2021-12-19 13:38:17,671 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:17,671 INFO L388 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 37 treesize of output 38 [2021-12-19 13:38:17,748 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:17,748 INFO L388 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 37 treesize of output 38 [2021-12-19 13:38:17,768 INFO L388 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 34 treesize of output 16 [2021-12-19 13:38:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:38:17,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:38:17,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4724) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:38:17,866 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4724) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:38:18,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4770))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4724)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:38:18,106 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:38:18,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012266114] [2021-12-19 13:38:18,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012266114] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:38:18,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1295438059] [2021-12-19 13:38:18,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:38:18,107 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:38:18,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:38:18,107 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:38:18,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2021-12-19 13:38:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:38:21,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 13:38:21,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:38:21,206 INFO L388 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 [2021-12-19 13:38:21,348 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:38:21,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-19 13:38:21,357 INFO L388 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 [2021-12-19 13:38:21,427 INFO L388 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 [2021-12-19 13:38:23,356 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:23,357 INFO L388 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 37 treesize of output 38 [2021-12-19 13:38:23,406 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:23,406 INFO L388 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 37 treesize of output 38 [2021-12-19 13:38:23,431 INFO L388 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 34 treesize of output 16 [2021-12-19 13:38:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:38:23,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:38:23,487 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:38:23,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5256))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5210)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:38:23,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1295438059] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:38:23,679 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:38:23,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2021-12-19 13:38:23,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580230849] [2021-12-19 13:38:23,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:38:23,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-19 13:38:23,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:38:23,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-19 13:38:23,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=248, Unknown=22, NotChecked=180, Total=506 [2021-12-19 13:38:23,680 INFO L87 Difference]: Start difference. First operand 2018 states and 2712 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:38:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:38:28,069 INFO L93 Difference]: Finished difference Result 3337 states and 4416 transitions. [2021-12-19 13:38:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-19 13:38:28,070 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 135 [2021-12-19 13:38:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:38:28,073 INFO L225 Difference]: With dead ends: 3337 [2021-12-19 13:38:28,073 INFO L226 Difference]: Without dead ends: 3337 [2021-12-19 13:38:28,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 172 SyntacticMatches, 90 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=83, Invalid=415, Unknown=28, NotChecked=230, Total=756 [2021-12-19 13:38:28,073 INFO L933 BasicCegarLoop]: 1112 mSDtfsCounter, 1606 mSDsluCounter, 7485 mSDsCounter, 0 mSdLazyCounter, 4285 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 8597 SdHoareTripleChecker+Invalid, 8845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4535 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:38:28,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1611 Valid, 8597 Invalid, 8845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4285 Invalid, 0 Unknown, 4535 Unchecked, 4.2s Time] [2021-12-19 13:38:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2021-12-19 13:38:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2017. [2021-12-19 13:38:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1460 states have (on average 1.8075342465753426) internal successors, (2639), 1974 states have internal predecessors, (2639), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:38:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2710 transitions. [2021-12-19 13:38:28,094 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2710 transitions. Word has length 135 [2021-12-19 13:38:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:38:28,095 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 2710 transitions. [2021-12-19 13:38:28,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:38:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2710 transitions. [2021-12-19 13:38:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-19 13:38:28,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:38:28,096 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:38:28,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-19 13:38:28,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2021-12-19 13:38:28,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:38:28,511 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:38:28,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:38:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1655953070, now seen corresponding path program 1 times [2021-12-19 13:38:28,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:38:28,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60610854] [2021-12-19 13:38:28,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:38:28,513 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:38:28,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:38:28,514 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:38:28,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-19 13:38:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:38:29,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 123 conjunts are in the unsatisfiable core [2021-12-19 13:38:29,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:38:29,476 INFO L388 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 [2021-12-19 13:38:29,730 INFO L388 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 [2021-12-19 13:38:29,761 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:38:29,761 INFO L388 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 14 treesize of output 14 [2021-12-19 13:38:29,785 INFO L388 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 [2021-12-19 13:38:29,789 INFO L388 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 [2021-12-19 13:38:29,884 INFO L388 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 [2021-12-19 13:38:29,886 INFO L388 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 [2021-12-19 13:38:31,321 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:31,322 INFO L388 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 [2021-12-19 13:38:31,326 INFO L388 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 [2021-12-19 13:38:31,411 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:31,411 INFO L388 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 [2021-12-19 13:38:31,414 INFO L388 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 [2021-12-19 13:38:31,433 INFO L388 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 [2021-12-19 13:38:31,435 INFO L388 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 [2021-12-19 13:38:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:38:31,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:38:31,593 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:38:31,615 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:38:32,188 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5834) .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5834) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-19 13:38:32,192 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:38:32,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60610854] [2021-12-19 13:38:32,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60610854] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:38:32,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1708213239] [2021-12-19 13:38:32,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:38:32,193 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:38:32,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:38:32,195 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:38:32,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2021-12-19 13:38:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:38:35,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 121 conjunts are in the unsatisfiable core [2021-12-19 13:38:35,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:38:35,100 INFO L388 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 [2021-12-19 13:38:35,299 INFO L388 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 [2021-12-19 13:38:35,322 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:38:35,322 INFO L388 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 14 treesize of output 14 [2021-12-19 13:38:35,358 INFO L388 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 [2021-12-19 13:38:35,362 INFO L388 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 [2021-12-19 13:38:35,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-19 13:38:35,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-19 13:38:36,767 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6319))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6320)))) is different from true [2021-12-19 13:38:36,802 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:36,803 INFO L388 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 [2021-12-19 13:38:36,806 INFO L388 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 [2021-12-19 13:38:36,916 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:36,917 INFO L388 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 [2021-12-19 13:38:36,920 INFO L388 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 [2021-12-19 13:38:36,939 INFO L388 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 [2021-12-19 13:38:36,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-19 13:38:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 13:38:36,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:38:36,983 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:38:37,010 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:38:37,574 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6414)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6413) .cse0 v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6413) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-19 13:38:37,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1708213239] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:38:37,580 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:38:37,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2021-12-19 13:38:37,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673644766] [2021-12-19 13:38:37,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:38:37,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-19 13:38:37,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:38:37,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-19 13:38:37,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=472, Unknown=27, NotChecked=350, Total=930 [2021-12-19 13:38:37,581 INFO L87 Difference]: Start difference. First operand 2017 states and 2710 transitions. Second operand has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:38:38,171 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6319))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5740))) (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5741))) (exists ((v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6320)))) is different from true [2021-12-19 13:38:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:38:47,637 INFO L93 Difference]: Finished difference Result 3338 states and 4416 transitions. [2021-12-19 13:38:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-19 13:38:47,638 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 135 [2021-12-19 13:38:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:38:47,640 INFO L225 Difference]: With dead ends: 3338 [2021-12-19 13:38:47,641 INFO L226 Difference]: Without dead ends: 3338 [2021-12-19 13:38:47,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 166 SyntacticMatches, 89 SemanticMatches, 39 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=152, Invalid=898, Unknown=38, NotChecked=552, Total=1640 [2021-12-19 13:38:47,641 INFO L933 BasicCegarLoop]: 1109 mSDtfsCounter, 2890 mSDsluCounter, 8574 mSDsCounter, 0 mSdLazyCounter, 10613 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2895 SdHoareTripleChecker+Valid, 9683 SdHoareTripleChecker+Invalid, 18098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 10613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7446 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2021-12-19 13:38:47,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2895 Valid, 9683 Invalid, 18098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 10613 Invalid, 0 Unknown, 7446 Unchecked, 9.7s Time] [2021-12-19 13:38:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2021-12-19 13:38:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2016. [2021-12-19 13:38:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 1460 states have (on average 1.8061643835616439) internal successors, (2637), 1973 states have internal predecessors, (2637), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:38:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 2708 transitions. [2021-12-19 13:38:47,665 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 2708 transitions. Word has length 135 [2021-12-19 13:38:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:38:47,666 INFO L470 AbstractCegarLoop]: Abstraction has 2016 states and 2708 transitions. [2021-12-19 13:38:47,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:38:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2708 transitions. [2021-12-19 13:38:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-19 13:38:47,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:38:47,667 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:38:47,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2021-12-19 13:38:47,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-19 13:38:48,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:38:48,082 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:38:48,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:38:48,082 INFO L85 PathProgramCache]: Analyzing trace with hash -503241629, now seen corresponding path program 1 times [2021-12-19 13:38:48,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:38:48,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154238880] [2021-12-19 13:38:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:38:48,083 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:38:48,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:38:48,086 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:38:48,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-19 13:38:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:38:49,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 13:38:49,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:38:49,172 INFO L388 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 [2021-12-19 13:38:49,334 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:38:49,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-19 13:38:49,353 INFO L388 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 [2021-12-19 13:38:49,428 INFO L388 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 [2021-12-19 13:38:51,236 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:51,236 INFO L388 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 37 treesize of output 38 [2021-12-19 13:38:51,334 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:51,334 INFO L388 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 37 treesize of output 38 [2021-12-19 13:38:51,399 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:51,399 INFO L388 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 37 treesize of output 38 [2021-12-19 13:38:51,414 INFO L388 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 34 treesize of output 16 [2021-12-19 13:38:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:38:51,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:38:51,532 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:38:51,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:38:51,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:38:51,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6916))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6869)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:38:51,744 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:38:51,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154238880] [2021-12-19 13:38:51,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154238880] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:38:51,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1632039757] [2021-12-19 13:38:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:38:51,745 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:38:51,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:38:51,746 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:38:51,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2021-12-19 13:38:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:38:55,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 13:38:55,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:38:55,336 INFO L388 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 [2021-12-19 13:38:55,476 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:38:55,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-19 13:38:55,485 INFO L388 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 [2021-12-19 13:38:55,529 INFO L388 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 [2021-12-19 13:38:57,251 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:57,251 INFO L388 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 37 treesize of output 38 [2021-12-19 13:38:57,315 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:57,315 INFO L388 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 37 treesize of output 38 [2021-12-19 13:38:57,349 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:38:57,349 INFO L388 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 37 treesize of output 38 [2021-12-19 13:38:57,364 INFO L388 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 34 treesize of output 16 [2021-12-19 13:38:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:38:57,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:38:57,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7372) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:38:57,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7372) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:38:57,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7371))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:38:57,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7371))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:38:57,617 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7418))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7371)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:38:57,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1632039757] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:38:57,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:38:57,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2021-12-19 13:38:57,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986882056] [2021-12-19 13:38:57,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:38:57,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 13:38:57,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:38:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 13:38:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=281, Unknown=28, NotChecked=378, Total=756 [2021-12-19 13:38:57,621 INFO L87 Difference]: Start difference. First operand 2016 states and 2708 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:39:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:39:03,697 INFO L93 Difference]: Finished difference Result 3335 states and 4412 transitions. [2021-12-19 13:39:03,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-19 13:39:03,698 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 138 [2021-12-19 13:39:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:39:03,703 INFO L225 Difference]: With dead ends: 3335 [2021-12-19 13:39:03,703 INFO L226 Difference]: Without dead ends: 3335 [2021-12-19 13:39:03,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 179 SyntacticMatches, 90 SemanticMatches, 31 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=96, Invalid=458, Unknown=34, NotChecked=468, Total=1056 [2021-12-19 13:39:03,705 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 1610 mSDsluCounter, 8610 mSDsCounter, 0 mSdLazyCounter, 5937 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1615 SdHoareTripleChecker+Valid, 9721 SdHoareTripleChecker+Invalid, 11215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5250 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-12-19 13:39:03,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1615 Valid, 9721 Invalid, 11215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 5937 Invalid, 0 Unknown, 5250 Unchecked, 5.9s Time] [2021-12-19 13:39:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2021-12-19 13:39:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2015. [2021-12-19 13:39:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1460 states have (on average 1.8047945205479452) internal successors, (2635), 1972 states have internal predecessors, (2635), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:39:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2706 transitions. [2021-12-19 13:39:03,727 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2706 transitions. Word has length 138 [2021-12-19 13:39:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:39:03,727 INFO L470 AbstractCegarLoop]: Abstraction has 2015 states and 2706 transitions. [2021-12-19 13:39:03,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:39:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2706 transitions. [2021-12-19 13:39:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-19 13:39:03,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:39:03,729 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:39:03,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2021-12-19 13:39:03,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-12-19 13:39:04,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:39:04,148 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:39:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:39:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash -503241628, now seen corresponding path program 1 times [2021-12-19 13:39:04,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:39:04,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214606193] [2021-12-19 13:39:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:39:04,149 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:39:04,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:39:04,150 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:39:04,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-19 13:39:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:39:05,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-19 13:39:05,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:39:05,329 INFO L388 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 [2021-12-19 13:39:05,587 INFO L388 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 [2021-12-19 13:39:05,629 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:39:05,629 INFO L388 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 14 treesize of output 14 [2021-12-19 13:39:05,660 INFO L388 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 [2021-12-19 13:39:05,667 INFO L388 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 [2021-12-19 13:39:05,784 INFO L388 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 [2021-12-19 13:39:05,788 INFO L388 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 [2021-12-19 13:39:07,111 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7917))) (exists ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7918))) (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32)))) is different from true [2021-12-19 13:39:07,151 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:39:07,152 INFO L388 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 [2021-12-19 13:39:07,155 INFO L388 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 [2021-12-19 13:39:07,237 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:39:07,238 INFO L388 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 [2021-12-19 13:39:07,241 INFO L388 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 [2021-12-19 13:39:07,312 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:39:07,313 INFO L388 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 [2021-12-19 13:39:07,315 INFO L388 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 [2021-12-19 13:39:07,335 INFO L388 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 15 treesize of output 7 [2021-12-19 13:39:07,337 INFO L388 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 [2021-12-19 13:39:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 13:39:07,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:39:07,491 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:39:07,509 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:39:07,546 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7919)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7920) .cse0 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7920) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-19 13:39:07,575 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7920) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_7919))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_7920) .cse4 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-19 13:39:08,216 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8014))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8013) .cse1 v_ArrVal_7920) (select (select (store .cse2 .cse1 v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7922))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8014)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_7919))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8013) .cse4 v_ArrVal_7920) .cse5 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 13:39:08,221 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:39:08,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214606193] [2021-12-19 13:39:08,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214606193] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:39:08,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [829063769] [2021-12-19 13:39:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:39:08,222 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:39:08,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:39:08,223 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:39:08,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2021-12-19 13:41:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:42:00,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 124 conjunts are in the unsatisfiable core [2021-12-19 13:42:00,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:42:00,138 INFO L388 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 [2021-12-19 13:42:00,307 INFO L388 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 [2021-12-19 13:42:00,329 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:42:00,329 INFO L388 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 14 treesize of output 14 [2021-12-19 13:42:00,363 INFO L388 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 [2021-12-19 13:42:00,370 INFO L388 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 [2021-12-19 13:42:00,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-19 13:42:00,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-19 13:42:01,747 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_8514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8514))) (exists ((v_ArrVal_8513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8513)))) is different from true [2021-12-19 13:42:01,783 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:01,783 INFO L388 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 [2021-12-19 13:42:01,786 INFO L388 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 [2021-12-19 13:42:01,895 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:01,895 INFO L388 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 [2021-12-19 13:42:01,898 INFO L388 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 [2021-12-19 13:42:01,980 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:01,981 INFO L388 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 [2021-12-19 13:42:01,985 INFO L388 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 [2021-12-19 13:42:02,012 INFO L388 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 [2021-12-19 13:42:02,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-19 13:42:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 13:42:02,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:42:02,066 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32)))))) is different from false [2021-12-19 13:42:02,088 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))) is different from false [2021-12-19 13:42:02,125 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8516)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8515) .cse0 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8515) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-19 13:42:02,151 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8516))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8515) .cse1 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_8515) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_8518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))) is different from false [2021-12-19 13:42:02,698 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8610))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8609) .cse1 v_ArrVal_8515) (select (select (store .cse2 .cse1 v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8518))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8610)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_8516))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8609) .cse4 v_ArrVal_8515) .cse5 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 13:42:02,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [829063769] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:42:02,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:42:02,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2021-12-19 13:42:02,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101022951] [2021-12-19 13:42:02,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:42:02,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-19 13:42:02,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:42:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-19 13:42:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=537, Unknown=13, NotChecked=684, Total=1332 [2021-12-19 13:42:02,704 INFO L87 Difference]: Start difference. First operand 2015 states and 2706 transitions. Second operand has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:42:03,310 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7917))) (exists ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7918))) (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_8514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8514))) (exists ((v_ArrVal_8513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8513)))) is different from true [2021-12-19 13:42:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:42:14,357 INFO L93 Difference]: Finished difference Result 3336 states and 4412 transitions. [2021-12-19 13:42:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-19 13:42:14,357 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 138 [2021-12-19 13:42:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:42:14,364 INFO L225 Difference]: With dead ends: 3336 [2021-12-19 13:42:14,364 INFO L226 Difference]: Without dead ends: 3336 [2021-12-19 13:42:14,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 172 SyntacticMatches, 89 SemanticMatches, 46 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=180, Invalid=1048, Unknown=14, NotChecked=1014, Total=2256 [2021-12-19 13:42:14,367 INFO L933 BasicCegarLoop]: 1113 mSDtfsCounter, 2106 mSDsluCounter, 9820 mSDsCounter, 0 mSdLazyCounter, 12472 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 10933 SdHoareTripleChecker+Invalid, 19986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7481 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2021-12-19 13:42:14,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2111 Valid, 10933 Invalid, 19986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12472 Invalid, 0 Unknown, 7481 Unchecked, 11.3s Time] [2021-12-19 13:42:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-12-19 13:42:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 2014. [2021-12-19 13:42:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2014 states, 1460 states have (on average 1.8034246575342465) internal successors, (2633), 1971 states have internal predecessors, (2633), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:42:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2704 transitions. [2021-12-19 13:42:14,384 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2704 transitions. Word has length 138 [2021-12-19 13:42:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:42:14,385 INFO L470 AbstractCegarLoop]: Abstraction has 2014 states and 2704 transitions. [2021-12-19 13:42:14,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:42:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2704 transitions. [2021-12-19 13:42:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-19 13:42:14,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:42:14,385 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:42:14,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-12-19 13:42:14,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2021-12-19 13:42:14,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:42:14,787 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:42:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:42:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1659802424, now seen corresponding path program 1 times [2021-12-19 13:42:14,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:42:14,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913716523] [2021-12-19 13:42:14,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:42:14,789 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:42:14,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:42:14,790 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:42:14,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-19 13:42:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:42:16,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 13:42:16,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:42:16,030 INFO L388 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 [2021-12-19 13:42:16,184 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:42:16,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-19 13:42:16,204 INFO L388 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 [2021-12-19 13:42:16,289 INFO L388 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 [2021-12-19 13:42:18,013 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:18,013 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:18,109 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:18,109 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:18,174 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:18,175 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:18,241 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:18,241 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:18,257 INFO L388 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 34 treesize of output 16 [2021-12-19 13:42:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:42:18,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:42:18,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:42:18,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9081))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:18,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:18,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9080))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:18,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9080))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:18,613 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9128))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9080)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:18,614 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:42:18,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913716523] [2021-12-19 13:42:18,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913716523] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:42:18,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1131000704] [2021-12-19 13:42:18,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:42:18,615 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:42:18,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:42:18,616 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:42:18,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2021-12-19 13:42:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:42:25,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-19 13:42:25,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:42:25,654 INFO L388 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 [2021-12-19 13:42:25,796 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:42:25,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-19 13:42:25,807 INFO L388 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 [2021-12-19 13:42:25,862 INFO L388 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 [2021-12-19 13:42:27,554 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:27,554 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:27,615 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:27,616 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:27,651 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:27,651 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:27,685 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:27,685 INFO L388 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 37 treesize of output 38 [2021-12-19 13:42:27,701 INFO L388 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 34 treesize of output 16 [2021-12-19 13:42:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:42:27,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:42:27,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:27,777 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:27,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:27,799 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:27,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9646))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9598)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:42:27,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1131000704] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:42:27,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:42:27,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2021-12-19 13:42:27,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802367780] [2021-12-19 13:42:27,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:42:27,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-19 13:42:27,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:42:27,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-19 13:42:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=316, Unknown=30, NotChecked=506, Total=930 [2021-12-19 13:42:27,996 INFO L87 Difference]: Start difference. First operand 2014 states and 2704 transitions. Second operand has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:42:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:42:32,415 INFO L93 Difference]: Finished difference Result 3333 states and 4408 transitions. [2021-12-19 13:42:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-19 13:42:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 141 [2021-12-19 13:42:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:42:32,418 INFO L225 Difference]: With dead ends: 3333 [2021-12-19 13:42:32,419 INFO L226 Difference]: Without dead ends: 3333 [2021-12-19 13:42:32,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 187 SyntacticMatches, 91 SemanticMatches, 34 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=105, Invalid=503, Unknown=36, NotChecked=616, Total=1260 [2021-12-19 13:42:32,419 INFO L933 BasicCegarLoop]: 1108 mSDtfsCounter, 1600 mSDsluCounter, 6770 mSDsCounter, 0 mSdLazyCounter, 4301 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 7878 SdHoareTripleChecker+Invalid, 9556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5227 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:42:32,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1605 Valid, 7878 Invalid, 9556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4301 Invalid, 0 Unknown, 5227 Unchecked, 4.2s Time] [2021-12-19 13:42:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2021-12-19 13:42:32,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2013. [2021-12-19 13:42:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1460 states have (on average 1.8020547945205478) internal successors, (2631), 1970 states have internal predecessors, (2631), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 13:42:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2702 transitions. [2021-12-19 13:42:32,440 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2702 transitions. Word has length 141 [2021-12-19 13:42:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:42:32,441 INFO L470 AbstractCegarLoop]: Abstraction has 2013 states and 2702 transitions. [2021-12-19 13:42:32,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:42:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2702 transitions. [2021-12-19 13:42:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-19 13:42:32,442 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:42:32,442 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:42:32,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2021-12-19 13:42:32,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2021-12-19 13:42:32,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:42:32,870 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 13:42:32,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:42:32,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1659802425, now seen corresponding path program 1 times [2021-12-19 13:42:32,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:42:32,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798386969] [2021-12-19 13:42:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:42:32,871 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:42:32,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:42:32,872 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:42:32,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-12-19 13:42:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:42:34,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 129 conjunts are in the unsatisfiable core [2021-12-19 13:42:34,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:42:34,351 INFO L388 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 [2021-12-19 13:42:34,608 INFO L388 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 [2021-12-19 13:42:34,639 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:42:34,639 INFO L388 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 14 treesize of output 14 [2021-12-19 13:42:34,662 INFO L388 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 [2021-12-19 13:42:34,678 INFO L388 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 [2021-12-19 13:42:34,773 INFO L388 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 [2021-12-19 13:42:34,776 INFO L388 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 [2021-12-19 13:42:36,149 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:36,149 INFO L388 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 [2021-12-19 13:42:36,152 INFO L388 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 [2021-12-19 13:42:36,240 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:36,241 INFO L388 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 [2021-12-19 13:42:36,245 INFO L388 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 [2021-12-19 13:42:36,316 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:36,317 INFO L388 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 [2021-12-19 13:42:36,319 INFO L388 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 [2021-12-19 13:42:36,396 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:42:36,396 INFO L388 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 [2021-12-19 13:42:36,399 INFO L388 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 [2021-12-19 13:42:36,421 INFO L388 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 15 treesize of output 7 [2021-12-19 13:42:36,428 INFO L388 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 [2021-12-19 13:42:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:42:36,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:42:36,629 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:42:36,649 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:42:36,683 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10164) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10165)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10164) .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:42:36,777 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10165))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10164) .cse1 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10164) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_10167)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))) is different from false [2021-12-19 13:42:36,880 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10162))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10163) .cse1 v_ArrVal_10164) (select (select (store .cse2 .cse1 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10167))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10162)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_10165))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10163) .cse4 v_ArrVal_10164) .cse5 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 13:42:37,611 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10162))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10165))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10163) .cse1 v_ArrVal_10164) .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_10162))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_10163) .cse8 v_ArrVal_10164) (select (select (store .cse9 .cse8 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse10) v_ArrVal_10167)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse10)))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))) is different from false [2021-12-19 13:42:39,586 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10258))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10162))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10259) .cse1 v_ArrVal_10163) .cse2 v_ArrVal_10164) (select (select (store .cse3 .cse2 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10167))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10258)) (.cse9 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_10162))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_10165))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10259) .cse6 v_ArrVal_10163) .cse7 v_ArrVal_10164) .cse8 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9) (_ bv24 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))))))))))) is different from false [2021-12-19 13:42:39,598 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:42:39,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798386969] [2021-12-19 13:42:39,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798386969] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:42:39,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [932607718] [2021-12-19 13:42:39,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:42:39,598 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:42:39,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:42:39,599 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:42:39,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2021-12-19 13:45:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:45:47,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 128 conjunts are in the unsatisfiable core [2021-12-19 13:45:47,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:45:47,477 INFO L388 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 [2021-12-19 13:45:48,195 INFO L388 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 [2021-12-19 13:45:48,282 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:45:48,282 INFO L388 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 14 treesize of output 14 [2021-12-19 13:45:48,449 INFO L388 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 [2021-12-19 13:45:48,466 INFO L388 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 [2021-12-19 13:45:48,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-19 13:45:48,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-19 13:45:54,281 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:45:54,282 INFO L388 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 [2021-12-19 13:45:54,292 INFO L388 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 [2021-12-19 13:45:54,724 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:45:54,725 INFO L388 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 [2021-12-19 13:45:54,734 INFO L388 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 [2021-12-19 13:45:55,041 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:45:55,042 INFO L388 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 [2021-12-19 13:45:55,052 INFO L388 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 [2021-12-19 13:45:55,372 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:45:55,372 INFO L388 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 [2021-12-19 13:45:55,384 INFO L388 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 [2021-12-19 13:45:55,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-19 13:45:55,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-19 13:45:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:45:55,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:45:55,584 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32)))))) is different from false [2021-12-19 13:45:55,633 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))) is different from false [2021-12-19 13:45:55,703 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10778) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10777)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10778) .cse2 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:45:55,828 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10778) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10779)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_10777))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_10778) .cse4 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-19 13:45:55,940 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10776)) (.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10777))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10775) .cse0 v_ArrVal_10778) .cse1 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10776))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10775) .cse6 v_ArrVal_10778) (select (select (store .cse7 .cse6 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) v_ArrVal_10779))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8)))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32)))))) is different from false [2021-12-19 13:45:57,763 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10776))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10775) .cse2 v_ArrVal_10778) (select (select (store .cse3 .cse2 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10779)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10776))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_10777))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10775) .cse6 v_ArrVal_10778) .cse7 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))))))))))) is different from false [2021-12-19 13:46:01,270 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10871))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10776))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10872) .cse1 v_ArrVal_10775) .cse2 v_ArrVal_10778) (select (select (store .cse3 .cse2 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10779))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10871)) (.cse9 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_10776))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_10777))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10872) .cse6 v_ArrVal_10775) .cse7 v_ArrVal_10778) .cse8 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9) (_ bv24 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))))))))))) is different from false [2021-12-19 13:46:01,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [932607718] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:46:01,293 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:46:01,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2021-12-19 13:46:01,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32746303] [2021-12-19 13:46:01,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:46:01,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-19 13:46:01,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:46:01,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-19 13:46:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=661, Unknown=36, NotChecked=910, Total=1722 [2021-12-19 13:46:01,295 INFO L87 Difference]: Start difference. First operand 2013 states and 2702 transitions. Second operand has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 22 states have internal predecessors, (165), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Killed by 15