./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:43:48,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:43:48,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:43:48,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:43:48,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:43:48,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:43:48,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:43:48,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:43:48,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:43:48,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:43:48,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:43:48,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:43:48,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:43:48,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:43:48,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:43:48,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:43:48,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:43:48,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:43:48,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:43:48,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:43:48,249 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:43:48,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:43:48,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:43:48,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:43:48,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:43:48,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:43:48,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:43:48,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:43:48,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:43:48,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:43:48,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:43:48,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:43:48,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:43:48,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:43:48,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:43:48,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:43:48,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:43:48,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:43:48,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:43:48,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:43:48,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:43:48,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:43:48,270 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 12:43:48,304 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:43:48,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:43:48,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:43:48,305 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:43:48,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:43:48,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:43:48,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:43:48,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:43:48,307 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:43:48,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:43:48,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:43:48,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:43:48,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:43:48,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:43:48,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:43:48,309 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:43:48,309 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:43:48,309 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:43:48,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:43:48,310 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:43:48,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:43:48,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:43:48,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:43:48,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:43:48,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:43:48,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:43:48,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:43:48,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:43:48,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 12:43:48,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 12:43:48,312 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 -> 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 [2022-07-23 12:43:48,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:43:48,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:43:48,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:43:48,623 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:43:48,623 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:43:48,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2022-07-23 12:43:48,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce7bf725/44ef83571a71442e9ec87fcd2e9cf5e3/FLAG3202ca357 [2022-07-23 12:43:49,153 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:43:49,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2022-07-23 12:43:49,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce7bf725/44ef83571a71442e9ec87fcd2e9cf5e3/FLAG3202ca357 [2022-07-23 12:43:49,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce7bf725/44ef83571a71442e9ec87fcd2e9cf5e3 [2022-07-23 12:43:49,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:43:49,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:43:49,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:43:49,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:43:49,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:43:49,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:43:49" (1/1) ... [2022-07-23 12:43:49,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce39762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:49, skipping insertion in model container [2022-07-23 12:43:49,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:43:49" (1/1) ... [2022-07-23 12:43:49,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:43:49,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:43:49,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i[33021,33034] [2022-07-23 12:43:50,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:43:50,019 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-23 12:43:50,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2a228d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:50, skipping insertion in model container [2022-07-23 12:43:50,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:43:50,021 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 12:43:50,023 INFO L158 Benchmark]: Toolchain (without parser) took 536.94ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 45.8MB in the beginning and 76.4MB in the end (delta: -30.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-07-23 12:43:50,024 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 12:43:50,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.44ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 45.6MB in the beginning and 76.4MB in the end (delta: -30.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-07-23 12:43:50,027 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.44ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 45.6MB in the beginning and 76.4MB in the end (delta: -30.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:43:51,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:43:51,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:43:51,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:43:51,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:43:51,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:43:51,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:43:51,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:43:51,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:43:51,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:43:51,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:43:51,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:43:51,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:43:51,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:43:51,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:43:51,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:43:51,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:43:51,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:43:51,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:43:51,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:43:51,940 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:43:51,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:43:51,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:43:51,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:43:51,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:43:51,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:43:51,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:43:51,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:43:51,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:43:51,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:43:51,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:43:51,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:43:51,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:43:51,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:43:51,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:43:51,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:43:51,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:43:51,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:43:51,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:43:51,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:43:51,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:43:51,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:43:51,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 12:43:52,001 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:43:52,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:43:52,002 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:43:52,003 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:43:52,004 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:43:52,004 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:43:52,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:43:52,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:43:52,005 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:43:52,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:43:52,006 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:43:52,007 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:43:52,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:43:52,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:43:52,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:43:52,008 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:43:52,008 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:43:52,008 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:43:52,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:43:52,008 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:43:52,009 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 12:43:52,009 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 12:43:52,009 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:43:52,009 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:43:52,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:43:52,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:43:52,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:43:52,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:43:52,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:43:52,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:43:52,011 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 12:43:52,012 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 12:43:52,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 12:43:52,012 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 -> 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 [2022-07-23 12:43:52,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:43:52,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:43:52,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:43:52,394 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:43:52,395 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:43:52,396 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2022-07-23 12:43:52,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b80e5a9/6a42f1eee1c14a518fb73124771b36a1/FLAG79c49a1e8 [2022-07-23 12:43:53,003 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:43:53,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2022-07-23 12:43:53,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b80e5a9/6a42f1eee1c14a518fb73124771b36a1/FLAG79c49a1e8 [2022-07-23 12:43:53,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b80e5a9/6a42f1eee1c14a518fb73124771b36a1 [2022-07-23 12:43:53,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:43:53,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:43:53,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:43:53,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:43:53,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:43:53,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:43:53" (1/1) ... [2022-07-23 12:43:53,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60931684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:53, skipping insertion in model container [2022-07-23 12:43:53,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:43:53" (1/1) ... [2022-07-23 12:43:53,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:43:53,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:43:53,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i[33021,33034] [2022-07-23 12:43:53,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:43:53,835 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 12:43:53,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:43:53,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i[33021,33034] [2022-07-23 12:43:53,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:43:53,947 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 12:43:53,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i[33021,33034] [2022-07-23 12:43:54,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:43:54,073 INFO L208 MainTranslator]: Completed translation [2022-07-23 12:43:54,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54 WrapperNode [2022-07-23 12:43:54,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:43:54,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 12:43:54,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 12:43:54,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 12:43:54,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (1/1) ... [2022-07-23 12:43:54,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (1/1) ... [2022-07-23 12:43:54,179 INFO L137 Inliner]: procedures = 180, calls = 186, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 628 [2022-07-23 12:43:54,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 12:43:54,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 12:43:54,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 12:43:54,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 12:43:54,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (1/1) ... [2022-07-23 12:43:54,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (1/1) ... [2022-07-23 12:43:54,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (1/1) ... [2022-07-23 12:43:54,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (1/1) ... [2022-07-23 12:43:54,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (1/1) ... [2022-07-23 12:43:54,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (1/1) ... [2022-07-23 12:43:54,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (1/1) ... [2022-07-23 12:43:54,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 12:43:54,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 12:43:54,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 12:43:54,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 12:43:54,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (1/1) ... [2022-07-23 12:43:54,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:43:54,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 12:43:54,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 12:43:54,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 12:43:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-23 12:43:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 12:43:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 12:43:54,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 12:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 12:43:54,328 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 12:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 12:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 12:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 12:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 12:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 12:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 12:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 12:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 12:43:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 12:43:54,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 12:43:54,482 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 12:43:54,493 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 12:43:54,497 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 12:43:57,369 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 12:43:57,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 12:43:57,388 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-23 12:43:57,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:43:57 BoogieIcfgContainer [2022-07-23 12:43:57,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 12:43:57,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 12:43:57,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 12:43:57,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 12:43:57,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:43:53" (1/3) ... [2022-07-23 12:43:57,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ee94e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:43:57, skipping insertion in model container [2022-07-23 12:43:57,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:43:54" (2/3) ... [2022-07-23 12:43:57,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ee94e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:43:57, skipping insertion in model container [2022-07-23 12:43:57,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:43:57" (3/3) ... [2022-07-23 12:43:57,402 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test1-1.i [2022-07-23 12:43:57,415 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 12:43:57,416 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 330 error locations. [2022-07-23 12:43:57,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 12:43:57,494 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ce8ea18, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@65ebe801 [2022-07-23 12:43:57,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 330 error locations. [2022-07-23 12:43:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 668 states, 325 states have (on average 2.230769230769231) internal successors, (725), 662 states have internal predecessors, (725), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:43:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 12:43:57,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:43:57,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 12:43:57,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:43:57,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:43:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-23 12:43:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:43:57,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947670114] [2022-07-23 12:43:57,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:43:57,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:43:57,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:43:57,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:43:57,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-23 12:43:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:43:57,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-23 12:43:57,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:43:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:43:57,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:43:57,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:43:57,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947670114] [2022-07-23 12:43:57,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947670114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:43:57,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:43:57,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:43:57,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462797659] [2022-07-23 12:43:57,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:43:57,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-23 12:43:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:43:57,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 12:43:57,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 12:43:57,733 INFO L87 Difference]: Start difference. First operand has 668 states, 325 states have (on average 2.230769230769231) internal successors, (725), 662 states have internal predecessors, (725), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:43:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:43:57,781 INFO L93 Difference]: Finished difference Result 659 states and 706 transitions. [2022-07-23 12:43:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 12:43:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 12:43:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:43:57,797 INFO L225 Difference]: With dead ends: 659 [2022-07-23 12:43:57,798 INFO L226 Difference]: Without dead ends: 657 [2022-07-23 12:43:57,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 12:43:57,802 INFO L413 NwaCegarLoop]: 706 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:43:57,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:43:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-07-23 12:43:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2022-07-23 12:43:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 320 states have (on average 2.11875) internal successors, (678), 651 states have internal predecessors, (678), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:43:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 704 transitions. [2022-07-23 12:43:57,870 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 704 transitions. Word has length 5 [2022-07-23 12:43:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:43:57,870 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 704 transitions. [2022-07-23 12:43:57,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:43:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 704 transitions. [2022-07-23 12:43:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 12:43:57,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:43:57,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 12:43:57,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 12:43:58,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:43:58,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:43:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:43:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-23 12:43:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:43:58,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268723787] [2022-07-23 12:43:58,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:43:58,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:43:58,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:43:58,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:43:58,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-23 12:43:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:43:58,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:43:58,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:43:58,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:43:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:43:58,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:43:58,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:43:58,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268723787] [2022-07-23 12:43:58,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268723787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:43:58,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:43:58,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:43:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116522532] [2022-07-23 12:43:58,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:43:58,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:43:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:43:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:43:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:43:58,249 INFO L87 Difference]: Start difference. First operand 657 states and 704 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:43:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:43:59,364 INFO L93 Difference]: Finished difference Result 615 states and 663 transitions. [2022-07-23 12:43:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:43:59,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 12:43:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:43:59,368 INFO L225 Difference]: With dead ends: 615 [2022-07-23 12:43:59,368 INFO L226 Difference]: Without dead ends: 615 [2022-07-23 12:43:59,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:43:59,369 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 596 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:43:59,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 351 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 12:43:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-23 12:43:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 608. [2022-07-23 12:43:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 320 states have (on average 1.965625) internal successors, (629), 602 states have internal predecessors, (629), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:43:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 655 transitions. [2022-07-23 12:43:59,399 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 655 transitions. Word has length 5 [2022-07-23 12:43:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:43:59,400 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 655 transitions. [2022-07-23 12:43:59,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:43:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 655 transitions. [2022-07-23 12:43:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 12:43:59,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:43:59,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 12:43:59,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-23 12:43:59,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:43:59,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:43:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:43:59,612 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-23 12:43:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:43:59,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998967138] [2022-07-23 12:43:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:43:59,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:43:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:43:59,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:43:59,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-23 12:43:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:43:59,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:43:59,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:43:59,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:43:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:43:59,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:43:59,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:43:59,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998967138] [2022-07-23 12:43:59,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998967138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:43:59,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:43:59,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:43:59,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390748463] [2022-07-23 12:43:59,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:43:59,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:43:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:43:59,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:43:59,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:43:59,722 INFO L87 Difference]: Start difference. First operand 608 states and 655 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:01,048 INFO L93 Difference]: Finished difference Result 675 states and 726 transitions. [2022-07-23 12:44:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:44:01,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 12:44:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:01,051 INFO L225 Difference]: With dead ends: 675 [2022-07-23 12:44:01,051 INFO L226 Difference]: Without dead ends: 675 [2022-07-23 12:44:01,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:44:01,053 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 254 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:01,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 752 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-23 12:44:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-07-23 12:44:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 630. [2022-07-23 12:44:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 352 states have (on average 1.9460227272727273) internal successors, (685), 624 states have internal predecessors, (685), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 711 transitions. [2022-07-23 12:44:01,069 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 711 transitions. Word has length 5 [2022-07-23 12:44:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:01,070 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 711 transitions. [2022-07-23 12:44:01,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 711 transitions. [2022-07-23 12:44:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 12:44:01,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:01,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 12:44:01,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:01,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:01,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:01,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:01,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1156735106, now seen corresponding path program 1 times [2022-07-23 12:44:01,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:01,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578077529] [2022-07-23 12:44:01,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:01,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:01,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:01,286 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:01,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-23 12:44:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:01,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:44:01,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:01,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:01,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:01,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578077529] [2022-07-23 12:44:01,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578077529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:01,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:01,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:44:01,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313078212] [2022-07-23 12:44:01,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:01,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:44:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:01,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:44:01,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:44:01,368 INFO L87 Difference]: Start difference. First operand 630 states and 711 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:01,466 INFO L93 Difference]: Finished difference Result 1211 states and 1353 transitions. [2022-07-23 12:44:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:44:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-23 12:44:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:01,486 INFO L225 Difference]: With dead ends: 1211 [2022-07-23 12:44:01,486 INFO L226 Difference]: Without dead ends: 1211 [2022-07-23 12:44:01,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:44:01,488 INFO L413 NwaCegarLoop]: 866 mSDtfsCounter, 569 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:01,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1505 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:44:01,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2022-07-23 12:44:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 631. [2022-07-23 12:44:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 353 states have (on average 1.9433427762039661) internal successors, (686), 625 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 712 transitions. [2022-07-23 12:44:01,508 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 712 transitions. Word has length 6 [2022-07-23 12:44:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:01,508 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 712 transitions. [2022-07-23 12:44:01,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 712 transitions. [2022-07-23 12:44:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 12:44:01,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:01,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:01,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:01,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:01,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:01,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:01,719 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-23 12:44:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:01,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421954873] [2022-07-23 12:44:01,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:01,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:01,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:01,721 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:01,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-23 12:44:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:01,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:44:01,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:01,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:01,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:01,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421954873] [2022-07-23 12:44:01,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421954873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:01,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:01,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:44:01,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120668201] [2022-07-23 12:44:01,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:01,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:44:01,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:01,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:44:01,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:44:01,844 INFO L87 Difference]: Start difference. First operand 631 states and 712 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:01,872 INFO L93 Difference]: Finished difference Result 595 states and 675 transitions. [2022-07-23 12:44:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:44:01,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 12:44:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:01,875 INFO L225 Difference]: With dead ends: 595 [2022-07-23 12:44:01,875 INFO L226 Difference]: Without dead ends: 595 [2022-07-23 12:44:01,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:44:01,877 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 563 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:01,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 627 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:44:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-07-23 12:44:01,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 589. [2022-07-23 12:44:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 335 states have (on average 1.9194029850746268) internal successors, (643), 583 states have internal predecessors, (643), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 669 transitions. [2022-07-23 12:44:01,890 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 669 transitions. Word has length 11 [2022-07-23 12:44:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:01,891 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 669 transitions. [2022-07-23 12:44:01,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 669 transitions. [2022-07-23 12:44:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 12:44:01,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:01,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:01,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:02,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:02,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:02,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:02,103 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-23 12:44:02,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:02,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892201943] [2022-07-23 12:44:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:02,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:02,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:02,104 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:02,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-23 12:44:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:02,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:44:02,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:02,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:02,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:02,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892201943] [2022-07-23 12:44:02,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892201943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:02,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:02,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:44:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723972447] [2022-07-23 12:44:02,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:02,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:44:02,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:44:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:44:02,228 INFO L87 Difference]: Start difference. First operand 589 states and 669 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:02,296 INFO L93 Difference]: Finished difference Result 574 states and 647 transitions. [2022-07-23 12:44:02,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:44:02,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 12:44:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:02,299 INFO L225 Difference]: With dead ends: 574 [2022-07-23 12:44:02,299 INFO L226 Difference]: Without dead ends: 574 [2022-07-23 12:44:02,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:44:02,300 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 534 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:02,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1127 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:44:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-07-23 12:44:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 567. [2022-07-23 12:44:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 327 states have (on average 1.8776758409785932) internal successors, (614), 561 states have internal predecessors, (614), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 640 transitions. [2022-07-23 12:44:02,356 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 640 transitions. Word has length 13 [2022-07-23 12:44:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:02,357 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 640 transitions. [2022-07-23 12:44:02,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 640 transitions. [2022-07-23 12:44:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 12:44:02,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:02,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:02,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:02,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:02,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:02,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-23 12:44:02,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:02,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703865765] [2022-07-23 12:44:02,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:02,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:02,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:02,572 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:02,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-23 12:44:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:02,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:44:02,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:02,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:44:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:02,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:02,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:02,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703865765] [2022-07-23 12:44:02,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703865765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:02,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:02,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:44:02,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121176542] [2022-07-23 12:44:02,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:02,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:44:02,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:02,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:44:02,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:44:02,763 INFO L87 Difference]: Start difference. First operand 567 states and 640 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:03,907 INFO L93 Difference]: Finished difference Result 611 states and 705 transitions. [2022-07-23 12:44:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:44:03,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 12:44:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:03,911 INFO L225 Difference]: With dead ends: 611 [2022-07-23 12:44:03,911 INFO L226 Difference]: Without dead ends: 611 [2022-07-23 12:44:03,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:44:03,912 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 960 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:03,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 385 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 12:44:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-07-23 12:44:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 563. [2022-07-23 12:44:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 327 states have (on average 1.8654434250764527) internal successors, (610), 557 states have internal predecessors, (610), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 636 transitions. [2022-07-23 12:44:03,924 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 636 transitions. Word has length 27 [2022-07-23 12:44:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:03,925 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 636 transitions. [2022-07-23 12:44:03,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 636 transitions. [2022-07-23 12:44:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 12:44:03,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:03,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:03,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:04,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:04,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-23 12:44:04,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:04,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487944867] [2022-07-23 12:44:04,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:04,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:04,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:04,142 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:04,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-23 12:44:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:04,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 12:44:04,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:04,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:44:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:04,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:04,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:04,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487944867] [2022-07-23 12:44:04,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487944867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:04,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:04,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:44:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585112513] [2022-07-23 12:44:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:04,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:44:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:04,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:44:04,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:44:04,424 INFO L87 Difference]: Start difference. First operand 563 states and 636 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:06,096 INFO L93 Difference]: Finished difference Result 645 states and 708 transitions. [2022-07-23 12:44:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:44:06,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 12:44:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:06,100 INFO L225 Difference]: With dead ends: 645 [2022-07-23 12:44:06,100 INFO L226 Difference]: Without dead ends: 645 [2022-07-23 12:44:06,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:44:06,101 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 351 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:06,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 923 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-23 12:44:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-07-23 12:44:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 559. [2022-07-23 12:44:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 327 states have (on average 1.853211009174312) internal successors, (606), 553 states have internal predecessors, (606), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 632 transitions. [2022-07-23 12:44:06,113 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 632 transitions. Word has length 27 [2022-07-23 12:44:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:06,113 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 632 transitions. [2022-07-23 12:44:06,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 632 transitions. [2022-07-23 12:44:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 12:44:06,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:06,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:06,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:06,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:06,325 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-23 12:44:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:06,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531261229] [2022-07-23 12:44:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:06,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:06,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:06,328 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:06,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-23 12:44:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:06,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:44:06,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:06,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:06,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:06,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531261229] [2022-07-23 12:44:06,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531261229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:06,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:06,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:44:06,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780015304] [2022-07-23 12:44:06,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:06,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:44:06,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:06,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:44:06,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:44:06,528 INFO L87 Difference]: Start difference. First operand 559 states and 632 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:06,571 INFO L93 Difference]: Finished difference Result 559 states and 628 transitions. [2022-07-23 12:44:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:44:06,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 12:44:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:06,575 INFO L225 Difference]: With dead ends: 559 [2022-07-23 12:44:06,575 INFO L226 Difference]: Without dead ends: 559 [2022-07-23 12:44:06,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:44:06,576 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 510 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:06,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1105 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:44:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-07-23 12:44:06,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 553. [2022-07-23 12:44:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 321 states have (on average 1.8566978193146417) internal successors, (596), 547 states have internal predecessors, (596), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 622 transitions. [2022-07-23 12:44:06,587 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 622 transitions. Word has length 42 [2022-07-23 12:44:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:06,588 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 622 transitions. [2022-07-23 12:44:06,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 622 transitions. [2022-07-23 12:44:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 12:44:06,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:06,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:06,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:06,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:06,803 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-23 12:44:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:06,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283224105] [2022-07-23 12:44:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:06,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:06,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:06,810 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:06,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-23 12:44:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:06,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:44:07,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:07,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:07,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:07,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283224105] [2022-07-23 12:44:07,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283224105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:07,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:07,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:44:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036300103] [2022-07-23 12:44:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:07,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:44:07,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:07,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:44:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:44:07,180 INFO L87 Difference]: Start difference. First operand 553 states and 622 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:07,249 INFO L93 Difference]: Finished difference Result 599 states and 668 transitions. [2022-07-23 12:44:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:44:07,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-23 12:44:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:07,253 INFO L225 Difference]: With dead ends: 599 [2022-07-23 12:44:07,253 INFO L226 Difference]: Without dead ends: 599 [2022-07-23 12:44:07,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:44:07,254 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 67 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:07,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1012 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:44:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-07-23 12:44:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2022-07-23 12:44:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 367 states have (on average 1.7493188010899183) internal successors, (642), 593 states have internal predecessors, (642), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 668 transitions. [2022-07-23 12:44:07,266 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 668 transitions. Word has length 50 [2022-07-23 12:44:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:07,266 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 668 transitions. [2022-07-23 12:44:07,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 668 transitions. [2022-07-23 12:44:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 12:44:07,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:07,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:07,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:07,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:07,479 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:07,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-23 12:44:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:07,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741814946] [2022-07-23 12:44:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:07,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:07,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:07,482 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:07,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-23 12:44:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:07,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 12:44:07,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:07,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:44:07,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:44:08,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:44:08,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 12:44:08,224 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:44:08,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 12:44:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:08,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:08,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:08,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741814946] [2022-07-23 12:44:08,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741814946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:08,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:08,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:44:08,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534157388] [2022-07-23 12:44:08,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:08,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:44:08,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:08,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:44:08,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:44:08,245 INFO L87 Difference]: Start difference. First operand 599 states and 668 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:09,259 INFO L93 Difference]: Finished difference Result 568 states and 638 transitions. [2022-07-23 12:44:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:44:09,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-23 12:44:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:09,262 INFO L225 Difference]: With dead ends: 568 [2022-07-23 12:44:09,262 INFO L226 Difference]: Without dead ends: 568 [2022-07-23 12:44:09,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:44:09,262 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 827 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:09,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 260 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 12:44:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-07-23 12:44:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 529. [2022-07-23 12:44:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 335 states have (on average 1.6059701492537313) internal successors, (538), 523 states have internal predecessors, (538), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 564 transitions. [2022-07-23 12:44:09,279 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 564 transitions. Word has length 53 [2022-07-23 12:44:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:09,279 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 564 transitions. [2022-07-23 12:44:09,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 564 transitions. [2022-07-23 12:44:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 12:44:09,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:09,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:09,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:09,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:09,494 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-23 12:44:09,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:09,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002438734] [2022-07-23 12:44:09,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:09,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:09,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:09,497 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:09,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-23 12:44:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:09,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:44:09,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:09,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:44:09,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:44:09,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 12:44:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:09,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:09,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:09,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002438734] [2022-07-23 12:44:09,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002438734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:09,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:09,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:44:09,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281386121] [2022-07-23 12:44:09,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:09,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:44:09,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:09,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:44:09,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:44:09,777 INFO L87 Difference]: Start difference. First operand 529 states and 564 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:11,083 INFO L93 Difference]: Finished difference Result 528 states and 563 transitions. [2022-07-23 12:44:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:44:11,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-23 12:44:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:11,086 INFO L225 Difference]: With dead ends: 528 [2022-07-23 12:44:11,086 INFO L226 Difference]: Without dead ends: 528 [2022-07-23 12:44:11,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 12:44:11,087 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 4 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:11,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1325 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-23 12:44:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-07-23 12:44:11,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-07-23 12:44:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 335 states have (on average 1.6029850746268657) internal successors, (537), 522 states have internal predecessors, (537), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 563 transitions. [2022-07-23 12:44:11,098 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 563 transitions. Word has length 58 [2022-07-23 12:44:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:11,098 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 563 transitions. [2022-07-23 12:44:11,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 563 transitions. [2022-07-23 12:44:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 12:44:11,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:11,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:11,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:11,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:11,312 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:11,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:11,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-23 12:44:11,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:11,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589267344] [2022-07-23 12:44:11,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:11,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:11,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:11,314 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:11,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-23 12:44:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:11,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 12:44:11,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:11,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:44:11,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:44:11,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:44:11,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 12:44:11,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 12:44:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:11,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:11,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:11,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589267344] [2022-07-23 12:44:11,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589267344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:11,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:11,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:44:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080943935] [2022-07-23 12:44:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:11,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:44:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:11,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:44:11,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:44:11,636 INFO L87 Difference]: Start difference. First operand 528 states and 563 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:12,977 INFO L93 Difference]: Finished difference Result 527 states and 562 transitions. [2022-07-23 12:44:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:44:12,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-23 12:44:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:12,979 INFO L225 Difference]: With dead ends: 527 [2022-07-23 12:44:12,979 INFO L226 Difference]: Without dead ends: 527 [2022-07-23 12:44:12,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 12:44:12,980 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 2 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:12,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1335 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-23 12:44:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-07-23 12:44:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2022-07-23 12:44:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 334 states have (on average 1.6047904191616766) internal successors, (536), 521 states have internal predecessors, (536), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-23 12:44:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 562 transitions. [2022-07-23 12:44:12,990 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 562 transitions. Word has length 58 [2022-07-23 12:44:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:12,991 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 562 transitions. [2022-07-23 12:44:12,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 12:44:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 562 transitions. [2022-07-23 12:44:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 12:44:12,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:12,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:13,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:13,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:13,204 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:13,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash -624458498, now seen corresponding path program 1 times [2022-07-23 12:44:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:13,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968682452] [2022-07-23 12:44:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:13,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:13,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:13,206 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:13,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-23 12:44:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:13,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:44:13,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:13,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:44:13,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:13,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968682452] [2022-07-23 12:44:13,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968682452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:44:13,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:44:13,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:44:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606483249] [2022-07-23 12:44:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:44:13,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:44:13,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:13,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:44:13,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:44:13,430 INFO L87 Difference]: Start difference. First operand 527 states and 562 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 12:44:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:13,471 INFO L93 Difference]: Finished difference Result 530 states and 566 transitions. [2022-07-23 12:44:13,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:44:13,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-07-23 12:44:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:13,474 INFO L225 Difference]: With dead ends: 530 [2022-07-23 12:44:13,475 INFO L226 Difference]: Without dead ends: 530 [2022-07-23 12:44:13,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:44:13,475 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 2 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:13,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1531 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:44:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-07-23 12:44:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-07-23 12:44:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 336 states have (on average 1.6041666666666667) internal successors, (539), 524 states have internal predecessors, (539), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-23 12:44:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 566 transitions. [2022-07-23 12:44:13,486 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 566 transitions. Word has length 66 [2022-07-23 12:44:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:13,486 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 566 transitions. [2022-07-23 12:44:13,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 12:44:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 566 transitions. [2022-07-23 12:44:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-23 12:44:13,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:13,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:13,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:13,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:13,705 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash -594716233, now seen corresponding path program 1 times [2022-07-23 12:44:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:13,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966131586] [2022-07-23 12:44:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:44:13,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:13,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:13,708 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:13,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-23 12:44:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:44:13,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:44:13,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:13,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:44:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:14,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:14,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966131586] [2022-07-23 12:44:14,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966131586] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:44:14,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:44:14,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 12:44:14,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713390600] [2022-07-23 12:44:14,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:44:14,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 12:44:14,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:14,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 12:44:14,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 12:44:14,042 INFO L87 Difference]: Start difference. First operand 530 states and 566 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:44:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:14,177 INFO L93 Difference]: Finished difference Result 542 states and 583 transitions. [2022-07-23 12:44:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 12:44:14,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-23 12:44:14,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:14,180 INFO L225 Difference]: With dead ends: 542 [2022-07-23 12:44:14,180 INFO L226 Difference]: Without dead ends: 542 [2022-07-23 12:44:14,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-23 12:44:14,181 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 23 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:14,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1535 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:44:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-07-23 12:44:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2022-07-23 12:44:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 345 states have (on average 1.6057971014492753) internal successors, (554), 533 states have internal predecessors, (554), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-23 12:44:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 581 transitions. [2022-07-23 12:44:14,192 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 581 transitions. Word has length 67 [2022-07-23 12:44:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:14,192 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 581 transitions. [2022-07-23 12:44:14,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:44:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 581 transitions. [2022-07-23 12:44:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 12:44:14,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:14,194 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:14,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-23 12:44:14,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:14,406 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:14,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash 133393214, now seen corresponding path program 2 times [2022-07-23 12:44:14,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:14,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288740286] [2022-07-23 12:44:14,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 12:44:14,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:14,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:14,409 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:14,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-23 12:44:14,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 12:44:14,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:44:14,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:44:14,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:14,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:44:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:14,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:14,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288740286] [2022-07-23 12:44:14,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288740286] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:44:14,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:44:14,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-23 12:44:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540441654] [2022-07-23 12:44:14,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:44:14,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 12:44:14,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:14,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 12:44:14,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 12:44:14,996 INFO L87 Difference]: Start difference. First operand 540 states and 581 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:44:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:15,478 INFO L93 Difference]: Finished difference Result 561 states and 609 transitions. [2022-07-23 12:44:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 12:44:15,478 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-23 12:44:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:15,480 INFO L225 Difference]: With dead ends: 561 [2022-07-23 12:44:15,481 INFO L226 Difference]: Without dead ends: 557 [2022-07-23 12:44:15,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-23 12:44:15,482 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 63 mSDsluCounter, 2563 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 3079 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:15,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 3079 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:44:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-07-23 12:44:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 549. [2022-07-23 12:44:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 354 states have (on average 1.5988700564971752) internal successors, (566), 542 states have internal predecessors, (566), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-23 12:44:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 593 transitions. [2022-07-23 12:44:15,493 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 593 transitions. Word has length 70 [2022-07-23 12:44:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:15,494 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 593 transitions. [2022-07-23 12:44:15,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:44:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 593 transitions. [2022-07-23 12:44:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 12:44:15,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:15,495 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:15,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-23 12:44:15,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:15,709 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:15,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash 419670174, now seen corresponding path program 3 times [2022-07-23 12:44:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:15,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143295404] [2022-07-23 12:44:15,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 12:44:15,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:15,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:15,711 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:15,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-23 12:44:16,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 12:44:16,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:44:16,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 12:44:16,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:16,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:44:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:17,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:17,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143295404] [2022-07-23 12:44:17,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143295404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:44:17,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:44:17,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 12:44:17,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890085024] [2022-07-23 12:44:17,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:44:17,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 12:44:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:17,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 12:44:17,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-23 12:44:17,123 INFO L87 Difference]: Start difference. First operand 549 states and 593 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:44:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:19,692 INFO L93 Difference]: Finished difference Result 591 states and 655 transitions. [2022-07-23 12:44:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-23 12:44:19,693 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-23 12:44:19,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:19,695 INFO L225 Difference]: With dead ends: 591 [2022-07-23 12:44:19,695 INFO L226 Difference]: Without dead ends: 585 [2022-07-23 12:44:19,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 12:44:19,696 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 196 mSDsluCounter, 5688 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 6209 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:19,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 6209 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 12:44:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-07-23 12:44:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 567. [2022-07-23 12:44:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 560 states have internal predecessors, (589), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-23 12:44:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 616 transitions. [2022-07-23 12:44:19,707 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 616 transitions. Word has length 76 [2022-07-23 12:44:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:19,707 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 616 transitions. [2022-07-23 12:44:19,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:44:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 616 transitions. [2022-07-23 12:44:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 12:44:19,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:19,708 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:19,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:19,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:19,923 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1934068574, now seen corresponding path program 4 times [2022-07-23 12:44:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:19,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848054692] [2022-07-23 12:44:19,924 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 12:44:19,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:19,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:19,926 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:19,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-23 12:44:20,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 12:44:20,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:44:20,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 12:44:20,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:20,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:44:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:44:22,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:22,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848054692] [2022-07-23 12:44:22,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848054692] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:44:22,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:44:22,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-23 12:44:22,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560476421] [2022-07-23 12:44:22,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:44:22,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 12:44:22,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:44:22,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 12:44:22,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 12:44:22,043 INFO L87 Difference]: Start difference. First operand 567 states and 616 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:44:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:44:32,922 INFO L93 Difference]: Finished difference Result 647 states and 728 transitions. [2022-07-23 12:44:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-23 12:44:32,923 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-23 12:44:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:44:32,925 INFO L225 Difference]: With dead ends: 647 [2022-07-23 12:44:32,925 INFO L226 Difference]: Without dead ends: 643 [2022-07-23 12:44:32,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-23 12:44:32,929 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 393 mSDsluCounter, 13692 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 14225 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-23 12:44:32,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 14225 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-23 12:44:32,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-07-23 12:44:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 601. [2022-07-23 12:44:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 406 states have (on average 1.564039408866995) internal successors, (635), 594 states have internal predecessors, (635), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-23 12:44:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 662 transitions. [2022-07-23 12:44:32,942 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 662 transitions. Word has length 88 [2022-07-23 12:44:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:44:32,942 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 662 transitions. [2022-07-23 12:44:32,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:44:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 662 transitions. [2022-07-23 12:44:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 12:44:32,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:44:32,943 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:44:32,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-23 12:44:33,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:44:33,157 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:44:33,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:44:33,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1476884034, now seen corresponding path program 5 times [2022-07-23 12:44:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:44:33,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407459887] [2022-07-23 12:44:33,158 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:44:33,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:44:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:44:33,159 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:44:33,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-23 12:44:34,380 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:44:34,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:44:34,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 12:44:34,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:44:34,449 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 12:44:34,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-23 12:44:34,725 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-23 12:44:34,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-23 12:44:34,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:44:34,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2022-07-23 12:44:35,094 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1562) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:44:35,737 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1581)))) is different from true [2022-07-23 12:44:36,523 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:44:36,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2022-07-23 12:44:36,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2022-07-23 12:44:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-07-23 12:44:36,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:44:36,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1651) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-23 12:44:36,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:44:36,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407459887] [2022-07-23 12:44:36,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407459887] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:44:36,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1099150895] [2022-07-23 12:44:36,855 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:44:36,855 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 12:44:36,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 12:44:36,857 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 12:44:36,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-23 12:46:02,754 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:46:02,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:46:02,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-23 12:46:02,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:46:02,988 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 12:46:02,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 12:46:03,173 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-23 12:46:03,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 41 [2022-07-23 12:46:03,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:46:03,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-23 12:46:05,840 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:46:05,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-23 12:46:05,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-07-23 12:46:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-23 12:46:05,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:46:06,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2097) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-23 12:46:06,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1099150895] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:46:06,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:46:06,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2022-07-23 12:46:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980502703] [2022-07-23 12:46:06,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:46:06,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 12:46:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:46:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 12:46:06,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=303, Unknown=27, NotChecked=156, Total=552 [2022-07-23 12:46:06,148 INFO L87 Difference]: Start difference. First operand 601 states and 662 transitions. Second operand has 20 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 12:46:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:46:09,909 INFO L93 Difference]: Finished difference Result 1042 states and 1121 transitions. [2022-07-23 12:46:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 12:46:09,910 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-07-23 12:46:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:46:09,913 INFO L225 Difference]: With dead ends: 1042 [2022-07-23 12:46:09,913 INFO L226 Difference]: Without dead ends: 1038 [2022-07-23 12:46:09,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 120 SyntacticMatches, 88 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=173, Invalid=724, Unknown=49, NotChecked=244, Total=1190 [2022-07-23 12:46:09,914 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 413 mSDsluCounter, 3174 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 3492 SdHoareTripleChecker+Invalid, 5457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3207 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:46:09,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 3492 Invalid, 5457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2239 Invalid, 0 Unknown, 3207 Unchecked, 3.2s Time] [2022-07-23 12:46:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2022-07-23 12:46:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 793. [2022-07-23 12:46:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 596 states have (on average 1.511744966442953) internal successors, (901), 783 states have internal predecessors, (901), 15 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (16), 6 states have call predecessors, (16), 15 states have call successors, (16) [2022-07-23 12:46:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 932 transitions. [2022-07-23 12:46:09,933 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 932 transitions. Word has length 110 [2022-07-23 12:46:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:46:09,934 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 932 transitions. [2022-07-23 12:46:09,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 12:46:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 932 transitions. [2022-07-23 12:46:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 12:46:09,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:46:09,936 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:46:09,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-23 12:46:10,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-23 12:46:10,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 12:46:10,357 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2022-07-23 12:46:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:46:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1476884033, now seen corresponding path program 1 times [2022-07-23 12:46:10,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:46:10,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45668571] [2022-07-23 12:46:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:46:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:46:10,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:46:10,359 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:46:10,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-23 12:46:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:46:11,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-23 12:46:11,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:46:11,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:46:11,313 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:46:11,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 12:46:11,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:46:11,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:46:11,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:46:11,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-23 12:46:11,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 12:46:11,515 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-07-23 12:46:11,567 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460))) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:46:11,579 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:46:11,627 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:46:11,639 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469)))) is different from true [2022-07-23 12:46:11,651 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471)))) is different from true [2022-07-23 12:46:11,662 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473)))) is different from true [2022-07-23 12:46:11,675 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474)))) is different from true [2022-07-23 12:46:11,718 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479)))) is different from true [2022-07-23 12:46:11,732 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:46:11,743 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:46:11,786 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:46:11,828 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491)))) is different from true [2022-07-23 12:46:11,841 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492)))) is different from true [2022-07-23 12:46:11,852 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494)))) is different from true [2022-07-23 12:46:11,864 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496)))) is different from true [2022-07-23 12:46:11,877 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498)))) is different from true [2022-07-23 12:46:11,920 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-23 12:46:11,962 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:46:11,974 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508)))) is different from true [2022-07-23 12:46:11,985 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:46:11,998 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512)))) is different from true [2022-07-23 12:46:12,046 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517)))) is different from true [2022-07-23 12:46:12,082 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-07-23 12:46:12,118 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:46:12,152 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:46:12,235 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534)))) is different from true [2022-07-23 12:46:12,246 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2022-07-23 12:46:12,257 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:46:12,301 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:46:12,339 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:46:12,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 12:46:12,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 12:46:12,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 12:46:12,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 12:46:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 885 not checked. [2022-07-23 12:46:12,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:46:13,266 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2022-07-23 12:46:13,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:46:13,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45668571] [2022-07-23 12:46:13,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45668571] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:46:13,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1588511942] [2022-07-23 12:46:13,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:46:13,273 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 12:46:13,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 12:46:13,274 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 12:46:13,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process