./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:58:05,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:58:05,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:58:05,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:58:05,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:58:05,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:58:05,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:58:05,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:58:05,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:58:05,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:58:05,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:58:05,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:58:05,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:58:05,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:58:05,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:58:05,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:58:05,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:58:05,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:58:05,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:58:05,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:58:05,375 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:58:05,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:58:05,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:58:05,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:58:05,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:58:05,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:58:05,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:58:05,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:58:05,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:58:05,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:58:05,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:58:05,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:58:05,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:58:05,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:58:05,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:58:05,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:58:05,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:58:05,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:58:05,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:58:05,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:58:05,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:58:05,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:58:05,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 05:58:05,416 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:58:05,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:58:05,418 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:58:05,418 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:58:05,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:58:05,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:58:05,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:58:05,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:58:05,420 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:58:05,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:58:05,421 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:58:05,421 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:58:05,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:58:05,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:58:05,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:58:05,422 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:58:05,422 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:58:05,422 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:58:05,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:58:05,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:58:05,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:58:05,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:58:05,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:58:05,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:58:05,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:58:05,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:58:05,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:58:05,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:58:05,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:58:05,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:58:05,424 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2022-07-23 05:58:05,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:58:05,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:58:05,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:58:05,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:58:05,662 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:58:05,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-07-23 05:58:05,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f775b6a/d25cc3119b5845438842196d92b29e2b/FLAG85587bbe9 [2022-07-23 05:58:06,048 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:58:06,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-07-23 05:58:06,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f775b6a/d25cc3119b5845438842196d92b29e2b/FLAG85587bbe9 [2022-07-23 05:58:06,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f775b6a/d25cc3119b5845438842196d92b29e2b [2022-07-23 05:58:06,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:58:06,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:58:06,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:58:06,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:58:06,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:58:06,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:58:06" (1/1) ... [2022-07-23 05:58:06,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e95bd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:06, skipping insertion in model container [2022-07-23 05:58:06,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:58:06" (1/1) ... [2022-07-23 05:58:06,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:58:06,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:58:06,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:58:06,786 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 05:58:06,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@c3be0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:06, skipping insertion in model container [2022-07-23 05:58:06,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:58:06,788 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 05:58:06,790 INFO L158 Benchmark]: Toolchain (without parser) took 326.16ms. Allocated memory is still 138.4MB. Free memory was 107.5MB in the beginning and 110.4MB in the end (delta: -2.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 05:58:06,791 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 05:58:06,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.82ms. Allocated memory is still 138.4MB. Free memory was 107.1MB in the beginning and 110.4MB in the end (delta: -3.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 05:58:06,793 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.20ms. Allocated memory is still 94.4MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.82ms. Allocated memory is still 138.4MB. Free memory was 107.1MB in the beginning and 110.4MB in the end (delta: -3.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: 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/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:58:08,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:58:08,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:58:08,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:58:08,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:58:08,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:58:08,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:58:08,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:58:08,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:58:08,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:58:08,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:58:08,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:58:08,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:58:08,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:58:08,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:58:08,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:58:08,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:58:08,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:58:08,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:58:08,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:58:08,279 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:58:08,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:58:08,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:58:08,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:58:08,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:58:08,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:58:08,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:58:08,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:58:08,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:58:08,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:58:08,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:58:08,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:58:08,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:58:08,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:58:08,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:58:08,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:58:08,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:58:08,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:58:08,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:58:08,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:58:08,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:58:08,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:58:08,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 05:58:08,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:58:08,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:58:08,311 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:58:08,311 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:58:08,312 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:58:08,312 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:58:08,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:58:08,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:58:08,313 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:58:08,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:58:08,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:58:08,313 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:58:08,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:58:08,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:58:08,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:58:08,314 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:58:08,314 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:58:08,314 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:58:08,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:58:08,315 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:58:08,315 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 05:58:08,315 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 05:58:08,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:58:08,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:58:08,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:58:08,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:58:08,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:58:08,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:58:08,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:58:08,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:58:08,317 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 05:58:08,317 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 05:58:08,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 05:58:08,317 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2022-07-23 05:58:08,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:58:08,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:58:08,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:58:08,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:58:08,550 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:58:08,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-07-23 05:58:08,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0578eef30/140879e317ab4310bbee710ac2354522/FLAGae499c35b [2022-07-23 05:58:09,045 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:58:09,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2022-07-23 05:58:09,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0578eef30/140879e317ab4310bbee710ac2354522/FLAGae499c35b [2022-07-23 05:58:09,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0578eef30/140879e317ab4310bbee710ac2354522 [2022-07-23 05:58:09,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:58:09,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:58:09,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:58:09,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:58:09,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:58:09,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca4fc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09, skipping insertion in model container [2022-07-23 05:58:09,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:58:09,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:58:09,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:58:09,370 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 05:58:09,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:58:09,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:58:09,417 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:58:09,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:58:09,492 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:58:09,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09 WrapperNode [2022-07-23 05:58:09,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:58:09,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:58:09,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:58:09,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:58:09,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,534 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-07-23 05:58:09,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:58:09,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:58:09,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:58:09,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:58:09,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:58:09,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:58:09,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:58:09,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:58:09,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (1/1) ... [2022-07-23 05:58:09,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:58:09,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:58:09,636 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 05:58:09,638 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 05:58:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 05:58:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 05:58:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-07-23 05:58:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-07-23 05:58:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 05:58:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 05:58:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:58:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:58:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:58:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 05:58:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 05:58:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 05:58:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:58:09,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:58:09,819 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:58:09,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:58:10,578 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:58:10,584 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:58:10,584 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-23 05:58:10,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:58:10 BoogieIcfgContainer [2022-07-23 05:58:10,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:58:10,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:58:10,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:58:10,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:58:10,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:58:09" (1/3) ... [2022-07-23 05:58:10,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9aa700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:58:10, skipping insertion in model container [2022-07-23 05:58:10,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:58:09" (2/3) ... [2022-07-23 05:58:10,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9aa700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:58:10, skipping insertion in model container [2022-07-23 05:58:10,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:58:10" (3/3) ... [2022-07-23 05:58:10,599 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2022-07-23 05:58:10,609 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:58:10,609 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-07-23 05:58:10,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:58:10,662 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@1d127c1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39cb2592 [2022-07-23 05:58:10,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-07-23 05:58:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 05:58:10,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:10,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 05:58:10,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:10,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2022-07-23 05:58:10,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:10,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366723869] [2022-07-23 05:58:10,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:10,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:10,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:10,704 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 05:58:10,705 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 05:58:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:10,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 05:58:10,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:10,816 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 05:58:10,847 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 05:58:10,848 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 05:58:10,892 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 05:58:10,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:10,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:10,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366723869] [2022-07-23 05:58:10,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366723869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:10,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:10,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:58:10,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985422314] [2022-07-23 05:58:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:10,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:58:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:10,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:58:10,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:58:10,925 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 05:58:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:11,342 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2022-07-23 05:58:11,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:58:11,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2022-07-23 05:58:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:11,352 INFO L225 Difference]: With dead ends: 208 [2022-07-23 05:58:11,353 INFO L226 Difference]: Without dead ends: 206 [2022-07-23 05:58:11,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 05:58:11,358 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:11,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:58:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-23 05:58:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2022-07-23 05:58:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2022-07-23 05:58:11,413 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2022-07-23 05:58:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:11,414 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2022-07-23 05:58:11,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 05:58:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2022-07-23 05:58:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 05:58:11,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:11,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 05:58:11,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-23 05:58:11,627 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 05:58:11,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:11,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2022-07-23 05:58:11,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:11,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021643967] [2022-07-23 05:58:11,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:11,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:11,632 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 05:58:11,634 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 05:58:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:11,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:58:11,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:11,702 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 05:58:11,707 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 05:58:11,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:11,750 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 05:58:11,762 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:58:11,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-23 05:58:11,774 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 05:58:11,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:11,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:11,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021643967] [2022-07-23 05:58:11,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021643967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:11,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:11,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:58:11,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041187616] [2022-07-23 05:58:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:11,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:58:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:58:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:58:11,777 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 05:58:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:12,188 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-07-23 05:58:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:58:12,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2022-07-23 05:58:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:12,191 INFO L225 Difference]: With dead ends: 196 [2022-07-23 05:58:12,191 INFO L226 Difference]: Without dead ends: 196 [2022-07-23 05:58:12,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 05:58:12,192 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:12,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:58:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-23 05:58:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2022-07-23 05:58:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2022-07-23 05:58:12,199 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2022-07-23 05:58:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:12,200 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2022-07-23 05:58:12,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 05:58:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2022-07-23 05:58:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 05:58:12,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:12,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 05:58:12,211 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 05:58:12,408 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 05:58:12,408 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:12,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2022-07-23 05:58:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:12,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187542944] [2022-07-23 05:58:12,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:12,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:12,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:12,411 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 05:58:12,427 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 05:58:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:12,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 05:58:12,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:12,489 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 05:58:12,499 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 05:58:12,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:12,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:12,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187542944] [2022-07-23 05:58:12,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187542944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:12,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:12,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:58:12,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614282090] [2022-07-23 05:58:12,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:12,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:58:12,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:12,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:58:12,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:12,505 INFO L87 Difference]: Start difference. First operand 185 states and 198 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 05:58:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:12,781 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-07-23 05:58:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:58:12,783 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 05:58:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:12,784 INFO L225 Difference]: With dead ends: 208 [2022-07-23 05:58:12,784 INFO L226 Difference]: Without dead ends: 208 [2022-07-23 05:58:12,785 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 05:58:12,785 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:12,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:58:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-23 05:58:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2022-07-23 05:58:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-07-23 05:58:12,812 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2022-07-23 05:58:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:12,812 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-07-23 05:58:12,812 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 05:58:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-07-23 05:58:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 05:58:12,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:12,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 05:58:12,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-23 05:58:13,027 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 05:58:13,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2022-07-23 05:58:13,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:13,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155148797] [2022-07-23 05:58:13,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:13,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:13,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:13,032 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 05:58:13,034 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 05:58:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:13,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 05:58:13,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:13,095 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 05:58:13,109 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 05:58:13,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:13,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:13,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155148797] [2022-07-23 05:58:13,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155148797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:13,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:13,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:58:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52254230] [2022-07-23 05:58:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:13,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:58:13,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:13,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:58:13,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:13,112 INFO L87 Difference]: Start difference. First operand 183 states and 195 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 05:58:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:13,434 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-07-23 05:58:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:58:13,435 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 05:58:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:13,436 INFO L225 Difference]: With dead ends: 181 [2022-07-23 05:58:13,436 INFO L226 Difference]: Without dead ends: 181 [2022-07-23 05:58:13,436 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 05:58:13,437 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:13,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:58:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-23 05:58:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-07-23 05:58:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2022-07-23 05:58:13,450 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2022-07-23 05:58:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:13,451 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2022-07-23 05:58:13,451 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 05:58:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-07-23 05:58:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:58:13,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:13,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:13,478 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 05:58:13,665 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 05:58:13,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:13,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2022-07-23 05:58:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:13,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415979467] [2022-07-23 05:58:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:13,670 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 05:58:13,672 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 05:58:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:13,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 05:58:13,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:13,750 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 05:58:13,773 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:58:13,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-23 05:58:13,808 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 14 treesize of output 16 [2022-07-23 05:58:13,812 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 14 treesize of output 16 [2022-07-23 05:58:13,835 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 15 treesize of output 7 [2022-07-23 05:58:13,837 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 15 treesize of output 7 [2022-07-23 05:58:13,858 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 05:58:13,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:13,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:13,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415979467] [2022-07-23 05:58:13,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415979467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:13,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:13,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:58:13,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878168871] [2022-07-23 05:58:13,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:13,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:58:13,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:13,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:58:13,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:58:13,861 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 05:58:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:14,196 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-07-23 05:58:14,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:58:14,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-07-23 05:58:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:14,197 INFO L225 Difference]: With dead ends: 183 [2022-07-23 05:58:14,198 INFO L226 Difference]: Without dead ends: 183 [2022-07-23 05:58:14,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:58:14,198 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:14,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 602 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:58:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-23 05:58:14,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2022-07-23 05:58:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:58:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-07-23 05:58:14,204 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2022-07-23 05:58:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:14,204 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-07-23 05:58:14,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 05:58:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-07-23 05:58:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:58:14,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:14,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:14,225 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 05:58:14,411 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 05:58:14,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2022-07-23 05:58:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:14,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261969988] [2022-07-23 05:58:14,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:14,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:14,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:14,414 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 05:58:14,416 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 05:58:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:14,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 05:58:14,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:14,482 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 05:58:14,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:14,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:14,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261969988] [2022-07-23 05:58:14,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261969988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:14,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:14,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:58:14,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003866956] [2022-07-23 05:58:14,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:14,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:58:14,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:14,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:58:14,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:58:14,484 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:14,504 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-07-23 05:58:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:58:14,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 05:58:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:14,506 INFO L225 Difference]: With dead ends: 258 [2022-07-23 05:58:14,506 INFO L226 Difference]: Without dead ends: 258 [2022-07-23 05:58:14,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 05:58:14,506 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:14,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 545 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:58:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-23 05:58:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2022-07-23 05:58:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 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 05:58:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2022-07-23 05:58:14,512 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2022-07-23 05:58:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:14,512 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2022-07-23 05:58:14,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2022-07-23 05:58:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:58:14,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:14,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:14,526 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 05:58:14,719 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 05:58:14,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2022-07-23 05:58:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:14,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200423985] [2022-07-23 05:58:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:14,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:14,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:14,722 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 05:58:14,724 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 05:58:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:14,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 05:58:14,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:14,793 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 05:58:14,793 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 1 case distinctions, treesize of input 9 treesize of output 14 [2022-07-23 05:58:14,801 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 05:58:14,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:14,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:14,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200423985] [2022-07-23 05:58:14,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200423985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:14,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:14,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:58:14,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35359673] [2022-07-23 05:58:14,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:14,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:58:14,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:14,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:58:14,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:14,803 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:15,023 INFO L93 Difference]: Finished difference Result 211 states and 249 transitions. [2022-07-23 05:58:15,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:58:15,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 05:58:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:15,025 INFO L225 Difference]: With dead ends: 211 [2022-07-23 05:58:15,025 INFO L226 Difference]: Without dead ends: 211 [2022-07-23 05:58:15,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:15,025 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:15,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 198 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:58:15,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-23 05:58:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-07-23 05:58:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 states have internal predecessors, (243), 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 05:58:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 247 transitions. [2022-07-23 05:58:15,029 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 247 transitions. Word has length 13 [2022-07-23 05:58:15,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:15,029 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 247 transitions. [2022-07-23 05:58:15,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 247 transitions. [2022-07-23 05:58:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:58:15,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:15,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:15,037 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 05:58:15,236 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 05:58:15,237 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:15,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2022-07-23 05:58:15,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:15,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625336367] [2022-07-23 05:58:15,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:15,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:15,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:15,239 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 05:58:15,240 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 05:58:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:15,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 05:58:15,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:15,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:58:15,308 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 9 treesize of output 11 [2022-07-23 05:58:15,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-23 05:58:15,325 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 05:58:15,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:15,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:15,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625336367] [2022-07-23 05:58:15,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625336367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:15,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:15,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:58:15,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310049932] [2022-07-23 05:58:15,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:15,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:58:15,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:58:15,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:15,328 INFO L87 Difference]: Start difference. First operand 209 states and 247 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:15,592 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-07-23 05:58:15,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:58:15,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 05:58:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:15,594 INFO L225 Difference]: With dead ends: 198 [2022-07-23 05:58:15,594 INFO L226 Difference]: Without dead ends: 198 [2022-07-23 05:58:15,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:58:15,594 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:15,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:58:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-23 05:58:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2022-07-23 05:58:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 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 05:58:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2022-07-23 05:58:15,597 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 13 [2022-07-23 05:58:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:15,597 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2022-07-23 05:58:15,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2022-07-23 05:58:15,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:58:15,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:15,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:15,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-23 05:58:15,798 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 05:58:15,799 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:15,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:15,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2022-07-23 05:58:15,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:15,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146114427] [2022-07-23 05:58:15,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:15,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:15,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:15,803 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 05:58:15,805 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 05:58:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:15,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 05:58:15,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:15,899 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 05:58:15,900 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-23 05:58:15,918 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 05:58:15,940 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 24 treesize of output 12 [2022-07-23 05:58:15,949 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 05:58:15,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:15,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:15,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146114427] [2022-07-23 05:58:15,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146114427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:15,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:15,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:58:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102704287] [2022-07-23 05:58:15,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:15,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:58:15,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:15,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:58:15,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:58:15,951 INFO L87 Difference]: Start difference. First operand 196 states and 221 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:16,372 INFO L93 Difference]: Finished difference Result 247 states and 285 transitions. [2022-07-23 05:58:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:58:16,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-23 05:58:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:16,374 INFO L225 Difference]: With dead ends: 247 [2022-07-23 05:58:16,374 INFO L226 Difference]: Without dead ends: 247 [2022-07-23 05:58:16,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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 05:58:16,375 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 25 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:16,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 397 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:58:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-23 05:58:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 202. [2022-07-23 05:58:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 states have internal predecessors, (227), 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 05:58:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 231 transitions. [2022-07-23 05:58:16,378 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 231 transitions. Word has length 17 [2022-07-23 05:58:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:16,378 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 231 transitions. [2022-07-23 05:58:16,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 231 transitions. [2022-07-23 05:58:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:58:16,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:16,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:16,389 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 05:58:16,586 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 05:58:16,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:16,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2022-07-23 05:58:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:16,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795189316] [2022-07-23 05:58:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:16,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:16,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:16,590 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 05:58:16,617 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 05:58:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:16,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 05:58:16,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:16,695 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:58:16,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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:58:16,725 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 05:58:16,732 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 05:58:16,776 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 05:58:16,779 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 05:58:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:16,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:58:16,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:16,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795189316] [2022-07-23 05:58:16,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795189316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:58:16,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:58:16,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:58:16,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143778878] [2022-07-23 05:58:16,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:58:16,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:58:16,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:16,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:58:16,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:58:16,793 INFO L87 Difference]: Start difference. First operand 202 states and 231 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:17,320 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2022-07-23 05:58:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:58:17,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-23 05:58:17,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:17,322 INFO L225 Difference]: With dead ends: 204 [2022-07-23 05:58:17,322 INFO L226 Difference]: Without dead ends: 204 [2022-07-23 05:58:17,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:58:17,323 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 5 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:17,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 414 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 05:58:17,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-23 05:58:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2022-07-23 05:58:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 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 05:58:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 227 transitions. [2022-07-23 05:58:17,326 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 227 transitions. Word has length 17 [2022-07-23 05:58:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:17,327 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 227 transitions. [2022-07-23 05:58:17,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 227 transitions. [2022-07-23 05:58:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 05:58:17,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:17,328 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:17,338 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 05:58:17,528 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 05:58:17,528 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:17,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2022-07-23 05:58:17,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:17,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749762241] [2022-07-23 05:58:17,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:17,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:17,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:17,530 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 05:58:17,531 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 05:58:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:17,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 05:58:17,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:17,642 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 05:58:17,642 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 20 treesize of output 22 [2022-07-23 05:58:17,658 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 05:58:17,742 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:17,742 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 34 treesize of output 35 [2022-07-23 05:58:17,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 05:58:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 05:58:17,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:17,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_176) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1))) is different from false [2022-07-23 05:58:17,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_176) c_create_data_~data~0.base) .cse0))) (_ bv1 1))) is different from false [2022-07-23 05:58:17,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:17,890 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-23 05:58:17,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-07-23 05:58:17,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-07-23 05:58:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 05:58:17,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:17,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749762241] [2022-07-23 05:58:17,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749762241] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:17,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:17,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-07-23 05:58:17,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670617896] [2022-07-23 05:58:17,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:17,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:58:17,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:17,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:58:17,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-23 05:58:17,941 INFO L87 Difference]: Start difference. First operand 202 states and 227 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:18,601 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2022-07-23 05:58:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:58:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-23 05:58:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:18,603 INFO L225 Difference]: With dead ends: 207 [2022-07-23 05:58:18,603 INFO L226 Difference]: Without dead ends: 207 [2022-07-23 05:58:18,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2022-07-23 05:58:18,603 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 25 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:18,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 736 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 369 Invalid, 0 Unknown, 266 Unchecked, 0.6s Time] [2022-07-23 05:58:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-23 05:58:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2022-07-23 05:58:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 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 05:58:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2022-07-23 05:58:18,607 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 22 [2022-07-23 05:58:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:18,607 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions. [2022-07-23 05:58:18,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions. [2022-07-23 05:58:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 05:58:18,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:18,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:18,631 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 05:58:18,808 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 05:58:18,808 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:18,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2022-07-23 05:58:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:18,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596498414] [2022-07-23 05:58:18,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:58:18,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:18,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:18,810 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 05:58:18,812 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 05:58:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:58:18,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 05:58:18,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:18,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-23 05:58:18,933 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 9 treesize of output 11 [2022-07-23 05:58:18,949 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 05:58:18,956 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 05:58:19,050 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:19,050 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 05:58:19,065 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 05:58:19,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 05:58:19,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 05:58:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:19,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:19,503 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2022-07-23 05:58:19,544 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_222) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_222) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_221) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-07-23 05:58:19,587 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1) v_ArrVal_222) c_create_data_~data~0.base) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_222) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_221) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-07-23 05:58:19,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:19,599 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-23 05:58:19,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:19,606 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-23 05:58:19,611 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 62 treesize of output 50 [2022-07-23 05:58:19,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 96 treesize of output 78 [2022-07-23 05:58:19,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-07-23 05:58:19,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 66 treesize of output 58 [2022-07-23 05:58:19,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:19,719 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-07-23 05:58:19,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-07-23 05:58:19,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 [2022-07-23 05:58:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 05:58:19,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:19,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596498414] [2022-07-23 05:58:19,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596498414] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:19,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:19,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-23 05:58:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272403223] [2022-07-23 05:58:19,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:19,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 05:58:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:19,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 05:58:19,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2022-07-23 05:58:19,796 INFO L87 Difference]: Start difference. First operand 201 states and 225 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:21,807 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2022-07-23 05:58:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:58:21,807 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-23 05:58:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:21,808 INFO L225 Difference]: With dead ends: 213 [2022-07-23 05:58:21,808 INFO L226 Difference]: Without dead ends: 213 [2022-07-23 05:58:21,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-07-23 05:58:21,809 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 17 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:21,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 909 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 479 Invalid, 0 Unknown, 254 Unchecked, 1.8s Time] [2022-07-23 05:58:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-23 05:58:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2022-07-23 05:58:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 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 05:58:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 235 transitions. [2022-07-23 05:58:21,814 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 235 transitions. Word has length 22 [2022-07-23 05:58:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:21,814 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 235 transitions. [2022-07-23 05:58:21,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 235 transitions. [2022-07-23 05:58:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 05:58:21,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:21,815 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:21,824 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 05:58:22,028 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 05:58:22,028 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:22,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:22,029 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2022-07-23 05:58:22,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:22,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310066328] [2022-07-23 05:58:22,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:58:22,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:22,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:22,030 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 05:58:22,032 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 05:58:22,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:58:22,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:58:22,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 05:58:22,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:22,214 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:58:22,214 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:58:22,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-23 05:58:22,235 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 05:58:22,242 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 05:58:22,323 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:22,323 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 05:58:22,327 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 05:58:22,417 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:22,417 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 05:58:22,422 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 05:58:22,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 05:58:22,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 05:58:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:22,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:22,864 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-07-23 05:58:22,916 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_284) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_284) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-07-23 05:58:22,970 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_284) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2022-07-23 05:58:23,027 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283)) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283) c_create_data_~data~0.base) .cse5) v_ArrVal_284) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2022-07-23 05:58:23,070 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3) v_ArrVal_284)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_283))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_282) .cse5 v_ArrVal_284) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_285) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-07-23 05:58:23,115 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) v_ArrVal_284)) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_283))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_282) .cse4 v_ArrVal_284) c_create_data_~data~0.base) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse5))))))))) is different from false [2022-07-23 05:58:23,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:23,134 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-07-23 05:58:23,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:23,141 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-07-23 05:58:23,151 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 102 treesize of output 84 [2022-07-23 05:58:23,167 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 174 treesize of output 144 [2022-07-23 05:58:23,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 102 treesize of output 86 [2022-07-23 05:58:23,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 86 treesize of output 78 [2022-07-23 05:58:23,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 116 treesize of output 92 [2022-07-23 05:58:23,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:23,219 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-07-23 05:58:23,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:23,228 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-07-23 05:58:23,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:23,233 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 92 treesize of output 56 [2022-07-23 05:58:23,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:23,238 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 50 treesize of output 32 [2022-07-23 05:58:23,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-23 05:58:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-23 05:58:23,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:23,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310066328] [2022-07-23 05:58:23,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310066328] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:23,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:23,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-07-23 05:58:23,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612427913] [2022-07-23 05:58:23,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:23,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 05:58:23,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:23,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 05:58:23,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2022-07-23 05:58:23,302 INFO L87 Difference]: Start difference. First operand 211 states and 235 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:25,576 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2022-07-23 05:58:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:58:25,577 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 05:58:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:25,577 INFO L225 Difference]: With dead ends: 223 [2022-07-23 05:58:25,577 INFO L226 Difference]: Without dead ends: 223 [2022-07-23 05:58:25,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2022-07-23 05:58:25,579 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 17 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:25,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1329 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 672 Invalid, 0 Unknown, 534 Unchecked, 1.9s Time] [2022-07-23 05:58:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-23 05:58:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2022-07-23 05:58:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 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 05:58:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions. [2022-07-23 05:58:25,584 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 27 [2022-07-23 05:58:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:25,584 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions. [2022-07-23 05:58:25,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions. [2022-07-23 05:58:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 05:58:25,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:25,585 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:25,614 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 05:58:25,796 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 05:58:25,796 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times [2022-07-23 05:58:25,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:25,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623704539] [2022-07-23 05:58:25,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:58:25,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:25,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:25,798 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 05:58:25,800 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 05:58:26,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-23 05:58:26,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:58:26,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 05:58:26,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:26,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-23 05:58:26,149 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 9 treesize of output 11 [2022-07-23 05:58:26,162 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 05:58:26,175 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 05:58:26,255 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:26,255 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 05:58:26,261 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 05:58:26,367 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:26,367 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 05:58:26,372 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 05:58:26,474 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:26,475 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 05:58:26,478 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 05:58:26,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 05:58:26,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 05:58:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:26,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:26,882 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_365) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2022-07-23 05:58:26,906 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_364) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_364) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_365) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-07-23 05:58:26,948 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_364) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_365) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_364) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2022-07-23 05:58:27,230 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363) c_create_data_~data~0.base) .cse2) v_ArrVal_364) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363)) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) .cse3 v_ArrVal_364) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_365) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-07-23 05:58:27,384 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse3) v_ArrVal_364)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_363))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_362) .cse5 v_ArrVal_364) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_365) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-07-23 05:58:27,442 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse3) v_ArrVal_364)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_363))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_362) .cse5 v_ArrVal_364) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_365) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-07-23 05:58:28,020 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_360)) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_363))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) .cse0 v_ArrVal_362) .cse1 v_ArrVal_364) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_365) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_360))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) .cse7 v_ArrVal_362) (select (select (store .cse8 .cse7 v_ArrVal_363) c_create_data_~data~0.base) .cse9) v_ArrVal_364))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse6))))) is different from false [2022-07-23 05:58:29,291 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_360))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_363))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_361) .cse1 v_ArrVal_362) .cse2 v_ArrVal_364) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_365) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse11 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_360))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_361) .cse9 v_ArrVal_362) (select (select (store .cse10 .cse9 v_ArrVal_363) c_create_data_~data~0.base) .cse11) v_ArrVal_364)))) c_create_data_~data~0.base) .cse11))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false [2022-07-23 05:58:29,391 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_360))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_361) .cse2 v_ArrVal_362) (select (select (store .cse3 .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse4) v_ArrVal_364)))) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd .cse0 (_ bv12 32)) (bvadd (_ bv16 32) .cse0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_360))) (let ((.cse6 (select (select .cse10 c_create_data_~data~0.base) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_363))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse8))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_361) .cse6 v_ArrVal_362) .cse7 v_ArrVal_364) c_create_data_~data~0.base) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_365) c_create_data_~data~0.base) .cse8))))))))))) is different from false [2022-07-23 05:58:29,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:29,427 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2022-07-23 05:58:29,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:29,447 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2022-07-23 05:58:29,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 588 treesize of output 498 [2022-07-23 05:58:29,470 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 6342 treesize of output 5964 [2022-07-23 05:58:29,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5960 treesize of output 5544 [2022-07-23 05:58:29,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5544 treesize of output 5000 [2022-07-23 05:58:29,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5000 treesize of output 4128 [2022-07-23 05:58:29,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4128 treesize of output 3920 [2022-07-23 05:58:29,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3920 treesize of output 3712 [2022-07-23 05:58:33,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:33,028 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2022-07-23 05:58:33,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:33,053 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2022-07-23 05:58:33,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:33,067 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 460 treesize of output 310 [2022-07-23 05:58:33,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:58:33,110 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 368 treesize of output 314 [2022-07-23 05:58:33,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 310 treesize of output 286 [2022-07-23 05:58:33,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 286 treesize of output 226 [2022-07-23 05:58:33,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 226 treesize of output 210 [2022-07-23 05:58:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2022-07-23 05:58:33,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:58:33,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623704539] [2022-07-23 05:58:33,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623704539] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:33,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:58:33,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2022-07-23 05:58:33,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122264318] [2022-07-23 05:58:33,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:33,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 05:58:33,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:58:33,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 05:58:33,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=194, Unknown=9, NotChecked=324, Total=600 [2022-07-23 05:58:33,310 INFO L87 Difference]: Start difference. First operand 221 states and 245 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:58:39,443 INFO L93 Difference]: Finished difference Result 233 states and 257 transitions. [2022-07-23 05:58:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 05:58:39,444 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 05:58:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:58:39,445 INFO L225 Difference]: With dead ends: 233 [2022-07-23 05:58:39,445 INFO L226 Difference]: Without dead ends: 233 [2022-07-23 05:58:39,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=110, Invalid=337, Unknown=9, NotChecked=414, Total=870 [2022-07-23 05:58:39,446 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 26 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 856 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-23 05:58:39,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1660 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 799 Invalid, 0 Unknown, 856 Unchecked, 4.7s Time] [2022-07-23 05:58:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-23 05:58:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-07-23 05:58:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 172 states have (on average 1.4593023255813953) internal successors, (251), 226 states have internal predecessors, (251), 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 05:58:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 255 transitions. [2022-07-23 05:58:39,449 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 255 transitions. Word has length 32 [2022-07-23 05:58:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:58:39,449 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 255 transitions. [2022-07-23 05:58:39,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:58:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 255 transitions. [2022-07-23 05:58:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 05:58:39,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:58:39,450 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:58:39,465 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 05:58:39,650 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 05:58:39,651 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-23 05:58:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:58:39,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1676760053, now seen corresponding path program 4 times [2022-07-23 05:58:39,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:58:39,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736645923] [2022-07-23 05:58:39,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:58:39,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:58:39,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:58:39,653 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 05:58:39,655 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 05:58:39,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:58:39,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:58:39,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 05:58:39,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:58:39,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-23 05:58:39,906 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 9 treesize of output 11 [2022-07-23 05:58:39,958 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 05:58:39,978 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 05:58:40,262 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:40,263 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 05:58:40,272 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 05:58:40,572 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:40,572 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 05:58:40,582 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 05:58:40,912 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:40,912 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 05:58:40,922 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 05:58:41,327 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:58:41,328 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 05:58:41,338 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 05:58:41,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 05:58:41,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 05:58:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:41,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:58:42,358 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_460) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_460) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_461) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-07-23 05:58:42,435 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_460) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_461) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_460) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse2 .cse3) (bvadd (_ bv8 32) .cse2 .cse3))))) is different from false [2022-07-23 05:58:42,520 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_460) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_460) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_461) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-07-23 05:58:42,624 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_458)) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_459) .cse0 v_ArrVal_460) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_461) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_459) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_458) c_create_data_~data~0.base) .cse5) v_ArrVal_460) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2022-07-23 05:58:42,688 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_459) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3) v_ArrVal_460)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_458))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_459) .cse5 v_ArrVal_460) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_461) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-07-23 05:58:42,778 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_459) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3) v_ArrVal_460)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_458))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_459) .cse5 v_ArrVal_460) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_461) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-07-23 05:58:44,918 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_457)) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_458))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_456) .cse0 v_ArrVal_459) .cse1 v_ArrVal_460) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_461) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_457))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_456) .cse7 v_ArrVal_459) (select (select (store .cse8 .cse7 v_ArrVal_458) c_create_data_~data~0.base) .cse9) v_ArrVal_460))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse6))))) is different from false [2022-07-23 05:58:47,072 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_457))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_458))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_456) .cse1 v_ArrVal_459) .cse2 v_ArrVal_460) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_461) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse11 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_457))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_456) .cse9 v_ArrVal_459) (select (select (store .cse10 .cse9 v_ArrVal_458) c_create_data_~data~0.base) .cse11) v_ArrVal_460)))) c_create_data_~data~0.base) .cse11))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false [2022-07-23 05:58:47,289 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_457))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_456) .cse3 v_ArrVal_459) (select (select (store .cse4 .cse3 v_ArrVal_458) c_create_data_~data~0.base) .cse5) v_ArrVal_460)))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_457))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_458))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_456) .cse7 v_ArrVal_459) .cse8 v_ArrVal_460) c_create_data_~data~0.base) .cse9) (_ bv20 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_461) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2022-07-23 05:58:49,954 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_455))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_457))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_454) .cse2 v_ArrVal_456) .cse3 v_ArrVal_459) (select (select (store .cse4 .cse3 v_ArrVal_458) c_create_data_~data~0.base) .cse5) v_ArrVal_460))))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_455)) (.cse10 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse7 (select (select .cse13 c_create_data_~data~0.base) .cse10))) (let ((.cse12 (store .cse13 .cse7 v_ArrVal_457))) (let ((.cse8 (select (select .cse12 c_create_data_~data~0.base) .cse10))) (let ((.cse11 (store .cse12 .cse8 v_ArrVal_458))) (let ((.cse9 (select (select .cse11 c_create_data_~data~0.base) .cse10))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_454) .cse7 v_ArrVal_456) .cse8 v_ArrVal_459) .cse9 v_ArrVal_460) c_create_data_~data~0.base) .cse10) (_ bv20 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_461) c_create_data_~data~0.base) .cse10))))))))))) is different from false [2022-07-23 05:58:53,350 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_455))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_457))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_454) .cse3 v_ArrVal_456) .cse4 v_ArrVal_459) (select (select (store .cse5 .cse4 v_ArrVal_458) c_create_data_~data~0.base) .cse6) v_ArrVal_460)))))) c_create_data_~data~0.base) .cse6))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse12))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_455))) (let ((.cse9 (select (select .cse15 c_create_data_~data~0.base) .cse12))) (let ((.cse14 (store .cse15 .cse9 v_ArrVal_457))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse12))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_458))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse12))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_454) .cse9 v_ArrVal_456) .cse10 v_ArrVal_459) .cse11 v_ArrVal_460) c_create_data_~data~0.base) .cse12) (_ bv20 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_461) c_create_data_~data~0.base) .cse12))))))))))))) is different from false [2022-07-23 05:58:54,604 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_455))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_457))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_458))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_454) .cse1 v_ArrVal_456) .cse2 v_ArrVal_459) .cse3 v_ArrVal_460) c_create_data_~data~0.base) .cse4) (_ bv20 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_461) c_create_data_~data~0.base) .cse4)))))))))))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (let ((.cse13 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse9 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse13))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_455))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse13))) (let ((.cse12 (store .cse14 .cse10 v_ArrVal_457))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse13))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_454) .cse10 v_ArrVal_456) .cse11 v_ArrVal_459) (select (select (store .cse12 .cse11 v_ArrVal_458) c_create_data_~data~0.base) .cse13) v_ArrVal_460)))))) c_create_data_~data~0.base) .cse13)))) (bvule (bvadd (_ bv16 32) .cse8) (bvadd .cse8 (_ bv20 32)))))) is different from false [2022-07-23 05:58:54,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:54,870 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 353 treesize of output 354 [2022-07-23 05:58:55,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:58:55,025 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 204 [2022-07-23 05:58:55,138 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 177384 treesize of output 149466 [2022-07-23 05:58:57,417 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 4628326 treesize of output 4549600 [2022-07-23 05:59:06,801 WARN L233 SmtUtils]: Spent 9.38s on a formula simplification that was a NOOP. DAG size: 4913 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:16,060 WARN L233 SmtUtils]: Spent 9.25s on a formula simplification that was a NOOP. DAG size: 4910 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:16,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4549596 treesize of output 4221532 [2022-07-23 05:59:25,265 WARN L233 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 4909 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:25,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4221532 treesize of output 3893468 [2022-07-23 05:59:34,843 WARN L233 SmtUtils]: Spent 9.38s on a formula simplification that was a NOOP. DAG size: 4908 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:35,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3893468 treesize of output 3810012 [2022-07-23 05:59:46,745 WARN L233 SmtUtils]: Spent 11.70s on a formula simplification that was a NOOP. DAG size: 4907 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:46,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3810012 treesize of output 3434716 [2022-07-23 05:59:56,136 WARN L233 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 4906 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 05:59:56,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3434716 treesize of output 3280860 [2022-07-23 06:00:05,533 WARN L233 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 4905 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:00:05,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3280860 treesize of output 3242588 [2022-07-23 06:00:15,601 WARN L233 SmtUtils]: Spent 9.85s on a formula simplification that was a NOOP. DAG size: 4904 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:00:15,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3242588 treesize of output 2987948 [2022-07-23 06:00:25,243 WARN L233 SmtUtils]: Spent 9.43s on a formula simplification that was a NOOP. DAG size: 4903 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:00:25,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2987948 treesize of output 2806124 [2022-07-23 06:00:35,337 WARN L233 SmtUtils]: Spent 9.89s on a formula simplification that was a NOOP. DAG size: 4899 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:01:09,104 WARN L233 SmtUtils]: Spent 33.65s on a formula simplification. DAG size of input: 4901 DAG size of output: 4901 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:02:12,714 WARN L233 SmtUtils]: Spent 53.46s on a formula simplification. DAG size of input: 4901 DAG size of output: 4901 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:02:33,876 WARN L233 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 2960 DAG size of output: 2960 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)