./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:23:27,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:23:27,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:23:27,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:23:27,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:23:27,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:23:27,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:23:27,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:23:27,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:23:27,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:23:27,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:23:27,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:23:27,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:23:27,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:23:27,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:23:27,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:23:27,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:23:27,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:23:27,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:23:27,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:23:27,330 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:23:27,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:23:27,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:23:27,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:23:27,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:23:27,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:23:27,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:23:27,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:23:27,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:23:27,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:23:27,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:23:27,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:23:27,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:23:27,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:23:27,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:23:27,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:23:27,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:23:27,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:23:27,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:23:27,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:23:27,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:23:27,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:23:27,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:23:27,364 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:23:27,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:23:27,365 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:23:27,365 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:23:27,366 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:23:27,366 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:23:27,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:23:27,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:23:27,367 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:23:27,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:23:27,367 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:23:27,368 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:23:27,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:23:27,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:23:27,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:23:27,369 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:23:27,369 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:23:27,369 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:23:27,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:23:27,370 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:23:27,370 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:23:27,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:23:27,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:23:27,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:23:27,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:23:27,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:23:27,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:23:27,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:23:27,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:23:27,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:23:27,373 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2022-07-20 05:23:27,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:23:27,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:23:27,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:23:27,647 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:23:27,648 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:23:27,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-07-20 05:23:27,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b862be503/30ed571c68a54a9a87972d874a706b7d/FLAG80d972e36 [2022-07-20 05:23:28,204 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:23:28,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-07-20 05:23:28,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b862be503/30ed571c68a54a9a87972d874a706b7d/FLAG80d972e36 [2022-07-20 05:23:28,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b862be503/30ed571c68a54a9a87972d874a706b7d [2022-07-20 05:23:28,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:23:28,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:23:28,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:23:28,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:23:28,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:23:28,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:23:28" (1/1) ... [2022-07-20 05:23:28,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610a40b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:28, skipping insertion in model container [2022-07-20 05:23:28,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:23:28" (1/1) ... [2022-07-20 05:23:28,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:23:28,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:23:29,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:23:29,013 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-20 05:23:29,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4ce8b4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:29, skipping insertion in model container [2022-07-20 05:23:29,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:23:29,014 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-20 05:23:29,016 INFO L158 Benchmark]: Toolchain (without parser) took 304.33ms. Allocated memory is still 88.1MB. Free memory was 55.1MB in the beginning and 62.3MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 05:23:29,017 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 88.1MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:23:29,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.85ms. Allocated memory is still 88.1MB. Free memory was 55.0MB in the beginning and 62.3MB in the end (delta: -7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 05:23:29,019 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.23ms. Allocated memory is still 88.1MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.85ms. Allocated memory is still 88.1MB. Free memory was 55.0MB in the beginning and 62.3MB in the end (delta: -7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 515]: 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/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:23:30,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:23:30,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:23:30,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:23:30,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:23:30,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:23:30,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:23:30,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:23:30,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:23:30,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:23:30,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:23:30,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:23:30,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:23:30,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:23:30,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:23:30,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:23:30,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:23:30,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:23:30,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:23:30,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:23:30,914 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:23:30,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:23:30,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:23:30,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:23:30,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:23:30,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:23:30,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:23:30,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:23:30,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:23:30,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:23:30,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:23:30,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:23:30,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:23:30,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:23:30,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:23:30,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:23:30,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:23:30,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:23:30,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:23:30,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:23:30,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:23:30,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:23:30,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 05:23:30,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:23:30,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:23:30,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:23:30,979 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:23:30,980 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:23:30,980 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:23:30,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:23:30,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:23:30,981 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:23:30,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:23:30,982 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:23:30,983 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:23:30,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:23:30,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:23:30,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:23:30,984 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:23:30,984 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:23:30,984 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:23:30,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:23:30,984 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:23:30,985 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:23:30,985 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:23:30,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:23:30,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:23:30,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:23:30,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:23:30,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:23:30,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:23:30,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:23:30,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:23:30,987 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:23:30,987 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:23:30,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:23:30,988 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2022-07-20 05:23:31,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:23:31,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:23:31,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:23:31,313 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:23:31,314 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:23:31,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-07-20 05:23:31,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92d21e50/70a6fa6be3a74107a98fe7893a120b58/FLAGef5f77e5a [2022-07-20 05:23:31,865 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:23:31,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-07-20 05:23:31,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92d21e50/70a6fa6be3a74107a98fe7893a120b58/FLAGef5f77e5a [2022-07-20 05:23:32,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92d21e50/70a6fa6be3a74107a98fe7893a120b58 [2022-07-20 05:23:32,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:23:32,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:23:32,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:23:32,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:23:32,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:23:32,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:32,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12aad4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32, skipping insertion in model container [2022-07-20 05:23:32,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:32,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:23:32,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:23:32,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:23:32,782 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 05:23:32,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:23:32,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:23:32,845 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:23:32,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:23:32,912 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:23:32,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32 WrapperNode [2022-07-20 05:23:32,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:23:32,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:23:32,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:23:32,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:23:32,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:32,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:32,984 INFO L137 Inliner]: procedures = 117, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2022-07-20 05:23:32,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:23:32,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:23:32,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:23:32,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:23:32,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:32,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:33,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:33,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:33,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:33,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:33,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:33,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:23:33,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:23:33,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:23:33,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:23:33,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (1/1) ... [2022-07-20 05:23:33,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:23:33,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:33,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:23:33,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:23:33,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 05:23:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:23:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:23:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 05:23:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:23:33,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:23:33,258 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:23:33,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:23:33,770 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:23:33,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:23:33,776 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 05:23:33,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:23:33 BoogieIcfgContainer [2022-07-20 05:23:33,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:23:33,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:23:33,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:23:33,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:23:33,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:23:32" (1/3) ... [2022-07-20 05:23:33,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a6a2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:23:33, skipping insertion in model container [2022-07-20 05:23:33,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:32" (2/3) ... [2022-07-20 05:23:33,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a6a2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:23:33, skipping insertion in model container [2022-07-20 05:23:33,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:23:33" (3/3) ... [2022-07-20 05:23:33,784 INFO L111 eAbstractionObserver]: Analyzing ICFG lis-alloca-1.i [2022-07-20 05:23:33,797 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:23:33,797 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-20 05:23:33,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:23:33,841 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@4f2afa97, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@212fe1df [2022-07-20 05:23:33,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-20 05:23:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.951219512195122) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:23:33,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:33,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:23:33,852 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:33,857 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2022-07-20 05:23:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:33,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795867025] [2022-07-20 05:23:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:33,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:33,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:33,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:33,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 05:23:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:33,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:23:33,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:34,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:23:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:34,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:34,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:34,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795867025] [2022-07-20 05:23:34,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795867025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:34,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:34,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:23:34,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152237821] [2022-07-20 05:23:34,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:34,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:23:34,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:34,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:23:34,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:34,127 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.951219512195122) internal successors, (80), 66 states have internal predecessors, (80), 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:34,290 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-07-20 05:23:34,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:23:34,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 05:23:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:34,300 INFO L225 Difference]: With dead ends: 66 [2022-07-20 05:23:34,308 INFO L226 Difference]: Without dead ends: 64 [2022-07-20 05:23:34,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:34,314 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 62 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:34,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 51 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-20 05:23:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-20 05:23:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-07-20 05:23:34,353 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 6 [2022-07-20 05:23:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:34,354 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-07-20 05:23:34,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-07-20 05:23:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:23:34,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:34,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:23:34,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:34,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:34,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:34,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash 889508874, now seen corresponding path program 1 times [2022-07-20 05:23:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:34,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383013288] [2022-07-20 05:23:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:34,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:34,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:34,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:34,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 05:23:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:34,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:23:34,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:34,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:23:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:34,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:34,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:34,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383013288] [2022-07-20 05:23:34,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383013288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:34,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:34,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603638233] [2022-07-20 05:23:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:34,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:34,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:34,670 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:35,089 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-07-20 05:23:35,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:35,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 05:23:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:35,093 INFO L225 Difference]: With dead ends: 129 [2022-07-20 05:23:35,093 INFO L226 Difference]: Without dead ends: 129 [2022-07-20 05:23:35,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:35,094 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 73 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:35,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 275 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:23:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-20 05:23:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 67. [2022-07-20 05:23:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 66 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-07-20 05:23:35,106 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 6 [2022-07-20 05:23:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:35,107 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-07-20 05:23:35,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-07-20 05:23:35,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:23:35,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:35,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:23:35,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:35,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:35,317 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:35,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:35,318 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-07-20 05:23:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:35,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173626197] [2022-07-20 05:23:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:35,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:35,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:35,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:35,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 05:23:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:35,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:23:35,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:35,407 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 8 treesize of output 7 [2022-07-20 05:23:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:35,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:35,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:35,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173626197] [2022-07-20 05:23:35,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173626197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:35,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:35,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754812142] [2022-07-20 05:23:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:35,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:35,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:35,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:35,464 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:35,494 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-20 05:23:35,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:23:35,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 05:23:35,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:35,496 INFO L225 Difference]: With dead ends: 69 [2022-07-20 05:23:35,496 INFO L226 Difference]: Without dead ends: 69 [2022-07-20 05:23:35,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:35,497 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:35,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 174 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 29 Unchecked, 0.0s Time] [2022-07-20 05:23:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-20 05:23:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-07-20 05:23:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.75) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-20 05:23:35,503 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 6 [2022-07-20 05:23:35,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:35,503 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-20 05:23:35,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-20 05:23:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:23:35,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:35,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:35,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:35,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:35,714 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash 176742579, now seen corresponding path program 1 times [2022-07-20 05:23:35,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:35,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921660101] [2022-07-20 05:23:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:35,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:35,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:35,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:35,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 05:23:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:35,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:23:35,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:35,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:35,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:35,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921660101] [2022-07-20 05:23:35,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921660101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:35,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:35,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614694696] [2022-07-20 05:23:35,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:35,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:35,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:35,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:35,801 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:35,838 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-07-20 05:23:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:35,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:23:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:35,840 INFO L225 Difference]: With dead ends: 70 [2022-07-20 05:23:35,841 INFO L226 Difference]: Without dead ends: 70 [2022-07-20 05:23:35,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:35,842 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 71 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:35,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 129 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-20 05:23:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2022-07-20 05:23:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2022-07-20 05:23:35,848 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 8 [2022-07-20 05:23:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:35,851 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2022-07-20 05:23:35,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-07-20 05:23:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:23:35,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:35,852 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:35,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:36,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:36,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1091210163, now seen corresponding path program 1 times [2022-07-20 05:23:36,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:36,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152228051] [2022-07-20 05:23:36,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:36,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:36,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:36,071 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:36,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 05:23:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:36,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:23:36,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:36,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:36,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:36,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152228051] [2022-07-20 05:23:36,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152228051] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:36,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:36,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 05:23:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881989990] [2022-07-20 05:23:36,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:36,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:23:36,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:23:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:23:36,220 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:36,294 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-07-20 05:23:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:23:36,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-20 05:23:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:36,296 INFO L225 Difference]: With dead ends: 127 [2022-07-20 05:23:36,296 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 05:23:36,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:23:36,297 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 317 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:36,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 255 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 05:23:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 72. [2022-07-20 05:23:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-07-20 05:23:36,304 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 10 [2022-07-20 05:23:36,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:36,304 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-07-20 05:23:36,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-07-20 05:23:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:23:36,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:36,305 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:36,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:36,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:36,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2022-07-20 05:23:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:36,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504407016] [2022-07-20 05:23:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:36,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:36,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:36,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:36,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 05:23:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:36,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:23:36,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:36,595 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 8 treesize of output 7 [2022-07-20 05:23:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:36,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:37,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:37,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504407016] [2022-07-20 05:23:37,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504407016] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:37,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:37,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-07-20 05:23:37,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242329319] [2022-07-20 05:23:37,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:37,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:23:37,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:37,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:23:37,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:23:37,229 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:37,997 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-07-20 05:23:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:23:37,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-20 05:23:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:38,001 INFO L225 Difference]: With dead ends: 135 [2022-07-20 05:23:38,001 INFO L226 Difference]: Without dead ends: 135 [2022-07-20 05:23:38,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:23:38,002 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 324 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:38,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 267 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 5 Unchecked, 0.7s Time] [2022-07-20 05:23:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-20 05:23:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 80. [2022-07-20 05:23:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-07-20 05:23:38,008 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 10 [2022-07-20 05:23:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:38,009 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-07-20 05:23:38,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-07-20 05:23:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:23:38,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:38,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:38,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:38,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:38,216 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:38,216 INFO L85 PathProgramCache]: Analyzing trace with hash -680998152, now seen corresponding path program 1 times [2022-07-20 05:23:38,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:38,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153583559] [2022-07-20 05:23:38,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:38,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:38,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:38,218 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:38,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 05:23:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:38,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:23:38,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:38,296 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 05:23:38,297 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-20 05:23:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:38,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:38,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:38,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153583559] [2022-07-20 05:23:38,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153583559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:38,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:38,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:23:38,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451625800] [2022-07-20 05:23:38,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:38,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:23:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:23:38,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:38,312 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:38,462 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-07-20 05:23:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:23:38,463 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), 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 12 [2022-07-20 05:23:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:38,465 INFO L225 Difference]: With dead ends: 73 [2022-07-20 05:23:38,465 INFO L226 Difference]: Without dead ends: 73 [2022-07-20 05:23:38,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:38,466 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:38,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-20 05:23:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-20 05:23:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-20 05:23:38,471 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 12 [2022-07-20 05:23:38,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:38,472 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-20 05:23:38,472 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-20 05:23:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:23:38,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:38,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:38,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:38,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:38,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:38,685 INFO L85 PathProgramCache]: Analyzing trace with hash -680998151, now seen corresponding path program 1 times [2022-07-20 05:23:38,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:38,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576334100] [2022-07-20 05:23:38,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:38,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:38,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:38,687 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:38,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 05:23:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:38,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:23:38,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:38,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:38,789 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-20 05:23:38,793 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-20 05:23:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:38,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:38,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:38,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576334100] [2022-07-20 05:23:38,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576334100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:38,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:38,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904032709] [2022-07-20 05:23:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:38,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:38,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:38,817 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:39,063 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2022-07-20 05:23:39,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:39,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-07-20 05:23:39,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:39,065 INFO L225 Difference]: With dead ends: 128 [2022-07-20 05:23:39,065 INFO L226 Difference]: Without dead ends: 128 [2022-07-20 05:23:39,065 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-20 05:23:39,065 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:39,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 139 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:23:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-20 05:23:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2022-07-20 05:23:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2022-07-20 05:23:39,070 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 12 [2022-07-20 05:23:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:39,071 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-07-20 05:23:39,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2022-07-20 05:23:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:23:39,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:39,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:39,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:39,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:39,272 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025161, now seen corresponding path program 1 times [2022-07-20 05:23:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:39,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621383174] [2022-07-20 05:23:39,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:39,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:39,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:39,274 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:39,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 05:23:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:39,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:23:39,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:39,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:39,371 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 11 treesize of output 13 [2022-07-20 05:23:39,376 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-20 05:23:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:39,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:39,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:39,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621383174] [2022-07-20 05:23:39,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621383174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:39,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:39,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:39,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882022275] [2022-07-20 05:23:39,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:39,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:23:39,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:39,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:23:39,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:39,432 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:39,644 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2022-07-20 05:23:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:23:39,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-07-20 05:23:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:39,645 INFO L225 Difference]: With dead ends: 118 [2022-07-20 05:23:39,645 INFO L226 Difference]: Without dead ends: 118 [2022-07-20 05:23:39,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:23:39,646 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 51 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:39,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 159 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2022-07-20 05:23:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-20 05:23:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 75. [2022-07-20 05:23:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 74 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2022-07-20 05:23:39,651 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 12 [2022-07-20 05:23:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:39,651 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2022-07-20 05:23:39,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2022-07-20 05:23:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:23:39,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:39,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:39,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:39,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:39,860 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:39,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:39,860 INFO L85 PathProgramCache]: Analyzing trace with hash 363893777, now seen corresponding path program 1 times [2022-07-20 05:23:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:39,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552807779] [2022-07-20 05:23:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:39,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:39,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:39,862 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:39,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 05:23:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:39,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:23:39,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:39,951 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 05:23:39,951 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-20 05:23:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:39,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:39,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:39,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552807779] [2022-07-20 05:23:39,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552807779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:39,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:39,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:23:39,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256373226] [2022-07-20 05:23:39,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:39,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:23:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:39,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:23:39,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:39,975 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:40,064 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-07-20 05:23:40,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:23:40,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 05:23:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:40,065 INFO L225 Difference]: With dead ends: 73 [2022-07-20 05:23:40,065 INFO L226 Difference]: Without dead ends: 73 [2022-07-20 05:23:40,066 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-20 05:23:40,066 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:40,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 54 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-20 05:23:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-20 05:23:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 72 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-07-20 05:23:40,070 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 13 [2022-07-20 05:23:40,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:40,070 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-07-20 05:23:40,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-07-20 05:23:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:23:40,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:40,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:40,082 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-20 05:23:40,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:40,281 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash 363893778, now seen corresponding path program 1 times [2022-07-20 05:23:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:40,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444891817] [2022-07-20 05:23:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:40,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:40,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:40,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:40,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 05:23:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:40,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:23:40,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:40,390 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:23:40,391 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-20 05:23:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:40,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:40,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:40,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444891817] [2022-07-20 05:23:40,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444891817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:40,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:40,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:40,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872211407] [2022-07-20 05:23:40,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:40,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:40,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:40,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:40,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:40,424 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:40,652 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2022-07-20 05:23:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:40,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 05:23:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:40,654 INFO L225 Difference]: With dead ends: 124 [2022-07-20 05:23:40,654 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 05:23:40,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:40,655 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 59 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:40,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 133 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:23:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 05:23:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 77. [2022-07-20 05:23:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.435483870967742) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-07-20 05:23:40,658 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 13 [2022-07-20 05:23:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:40,659 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-07-20 05:23:40,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-07-20 05:23:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:23:40,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:40,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:40,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:40,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:40,860 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1064958356, now seen corresponding path program 1 times [2022-07-20 05:23:40,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:40,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331913508] [2022-07-20 05:23:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:40,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:40,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:40,862 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:40,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 05:23:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:40,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:23:40,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:40,952 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-20 05:23:40,953 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 11 treesize of output 17 [2022-07-20 05:23:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:41,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:41,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:41,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331913508] [2022-07-20 05:23:41,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331913508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:41,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:41,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:41,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771859286] [2022-07-20 05:23:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:41,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:23:41,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:41,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:23:41,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:41,035 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:41,265 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2022-07-20 05:23:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:23:41,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 05:23:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:41,267 INFO L225 Difference]: With dead ends: 117 [2022-07-20 05:23:41,267 INFO L226 Difference]: Without dead ends: 117 [2022-07-20 05:23:41,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:23:41,268 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 50 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:41,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 149 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 43 Unchecked, 0.2s Time] [2022-07-20 05:23:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-20 05:23:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 74. [2022-07-20 05:23:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-20 05:23:41,271 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 13 [2022-07-20 05:23:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:41,271 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-20 05:23:41,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-20 05:23:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:23:41,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:41,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:41,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-20 05:23:41,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:41,486 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1808065813, now seen corresponding path program 1 times [2022-07-20 05:23:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:41,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328336390] [2022-07-20 05:23:41,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:41,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:41,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:41,488 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:41,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 05:23:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:41,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:23:41,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:41,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:41,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:41,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328336390] [2022-07-20 05:23:41,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328336390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:41,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:41,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116954277] [2022-07-20 05:23:41,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:41,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:41,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:41,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:41,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:41,570 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:41,831 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2022-07-20 05:23:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:41,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-07-20 05:23:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:41,832 INFO L225 Difference]: With dead ends: 124 [2022-07-20 05:23:41,833 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 05:23:41,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:41,833 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:41,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 208 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:23:41,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 05:23:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 76. [2022-07-20 05:23:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2022-07-20 05:23:41,836 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 15 [2022-07-20 05:23:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:41,836 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-07-20 05:23:41,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2022-07-20 05:23:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:23:41,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:41,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:41,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:42,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:42,047 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:42,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1221259799, now seen corresponding path program 1 times [2022-07-20 05:23:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:42,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982826145] [2022-07-20 05:23:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:42,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:42,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:42,051 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:42,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 05:23:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:42,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:23:42,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:42,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:42,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:42,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982826145] [2022-07-20 05:23:42,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982826145] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:42,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:42,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-07-20 05:23:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260619498] [2022-07-20 05:23:42,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:42,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:23:42,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:23:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:23:42,309 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:42,740 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-07-20 05:23:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:23:42,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 15 [2022-07-20 05:23:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:42,742 INFO L225 Difference]: With dead ends: 126 [2022-07-20 05:23:42,742 INFO L226 Difference]: Without dead ends: 126 [2022-07-20 05:23:42,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:23:42,743 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 375 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:42,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 170 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:23:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-20 05:23:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2022-07-20 05:23:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.423728813559322) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-07-20 05:23:42,746 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 15 [2022-07-20 05:23:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:42,746 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-07-20 05:23:42,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-07-20 05:23:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:23:42,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:42,747 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:42,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:42,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:42,948 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:42,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:42,948 INFO L85 PathProgramCache]: Analyzing trace with hash 262068158, now seen corresponding path program 1 times [2022-07-20 05:23:42,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:42,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307529944] [2022-07-20 05:23:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:42,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:42,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:42,950 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:42,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 05:23:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:43,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:23:43,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:43,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:43,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307529944] [2022-07-20 05:23:43,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307529944] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:43,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:43,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 05:23:43,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548954161] [2022-07-20 05:23:43,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:43,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:23:43,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:43,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:23:43,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:23:43,114 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:43,295 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-07-20 05:23:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:23:43,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 16 [2022-07-20 05:23:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:43,296 INFO L225 Difference]: With dead ends: 96 [2022-07-20 05:23:43,296 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 05:23:43,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:23:43,297 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:43,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:23:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 05:23:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-07-20 05:23:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-07-20 05:23:43,300 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 16 [2022-07-20 05:23:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:43,301 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-07-20 05:23:43,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-07-20 05:23:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:23:43,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:43,302 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:43,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:43,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:43,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash -749049092, now seen corresponding path program 1 times [2022-07-20 05:23:43,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:43,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122733876] [2022-07-20 05:23:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:43,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:43,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:43,515 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:43,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 05:23:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:43,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:23:43,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:43,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:43,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:43,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122733876] [2022-07-20 05:23:43,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122733876] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:43,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:43,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2022-07-20 05:23:43,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157375207] [2022-07-20 05:23:43,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:43,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:23:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:43,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:23:43,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:23:43,848 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:44,304 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-07-20 05:23:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:23:44,306 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 16 [2022-07-20 05:23:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:44,307 INFO L225 Difference]: With dead ends: 112 [2022-07-20 05:23:44,307 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 05:23:44,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:23:44,308 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 147 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:44,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 349 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:23:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 05:23:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 90. [2022-07-20 05:23:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-07-20 05:23:44,311 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 16 [2022-07-20 05:23:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:44,311 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-07-20 05:23:44,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-07-20 05:23:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:23:44,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:44,312 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1] [2022-07-20 05:23:44,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:44,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:44,522 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:44,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1817992175, now seen corresponding path program 2 times [2022-07-20 05:23:44,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:44,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253210682] [2022-07-20 05:23:44,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:23:44,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:44,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:44,525 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:44,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 05:23:44,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:23:44,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:44,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:23:44,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:44,624 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 8 treesize of output 7 [2022-07-20 05:23:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:44,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:45,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:45,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253210682] [2022-07-20 05:23:45,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253210682] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:45,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:45,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-07-20 05:23:45,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088848804] [2022-07-20 05:23:45,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:45,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:23:45,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:23:45,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:23:45,826 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:48,461 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2022-07-20 05:23:48,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:23:48,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 05:23:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:48,463 INFO L225 Difference]: With dead ends: 212 [2022-07-20 05:23:48,463 INFO L226 Difference]: Without dead ends: 212 [2022-07-20 05:23:48,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2022-07-20 05:23:48,464 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 427 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:48,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 619 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 464 Invalid, 0 Unknown, 9 Unchecked, 1.5s Time] [2022-07-20 05:23:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-20 05:23:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 106. [2022-07-20 05:23:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 105 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-07-20 05:23:48,466 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 18 [2022-07-20 05:23:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:48,467 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-07-20 05:23:48,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-07-20 05:23:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:23:48,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:48,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:48,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:48,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:48,668 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:48,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -302012765, now seen corresponding path program 1 times [2022-07-20 05:23:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:48,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518443028] [2022-07-20 05:23:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:48,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:48,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:48,670 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:48,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 05:23:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:48,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:23:48,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:48,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:48,994 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 25 treesize of output 21 [2022-07-20 05:23:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:49,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:49,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518443028] [2022-07-20 05:23:49,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518443028] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:49,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:49,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-20 05:23:49,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905897030] [2022-07-20 05:23:49,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:23:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:49,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:23:49,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:23:49,063 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,688 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-07-20 05:23:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:23:49,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:23:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,690 INFO L225 Difference]: With dead ends: 163 [2022-07-20 05:23:49,690 INFO L226 Difference]: Without dead ends: 163 [2022-07-20 05:23:49,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:23:49,691 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 165 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 157 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 05:23:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-20 05:23:49,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2022-07-20 05:23:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 116 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2022-07-20 05:23:49,697 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 20 [2022-07-20 05:23:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,697 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2022-07-20 05:23:49,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2022-07-20 05:23:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:23:49,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,698 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:49,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:49,899 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:49,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1581646975, now seen corresponding path program 2 times [2022-07-20 05:23:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:49,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612927082] [2022-07-20 05:23:49,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:23:49,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:49,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:49,902 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:49,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 05:23:49,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:23:49,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:49,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:23:49,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:50,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:50,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-07-20 05:23:50,041 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-20 05:23:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:23:50,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:50,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:23:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:23:50,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:50,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612927082] [2022-07-20 05:23:50,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612927082] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:50,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:50,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-07-20 05:23:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750921718] [2022-07-20 05:23:50,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:50,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:23:50,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:50,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:23:50,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:23:50,509 INFO L87 Difference]: Start difference. First operand 117 states and 141 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:51,318 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2022-07-20 05:23:51,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:23:51,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:23:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:51,320 INFO L225 Difference]: With dead ends: 161 [2022-07-20 05:23:51,320 INFO L226 Difference]: Without dead ends: 161 [2022-07-20 05:23:51,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:23:51,321 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 114 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:51,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 247 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 226 Invalid, 0 Unknown, 69 Unchecked, 0.7s Time] [2022-07-20 05:23:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-20 05:23:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 133. [2022-07-20 05:23:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 132 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2022-07-20 05:23:51,325 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 20 [2022-07-20 05:23:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:51,325 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2022-07-20 05:23:51,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2022-07-20 05:23:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:23:51,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:51,326 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:51,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-20 05:23:51,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:51,535 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1786415948, now seen corresponding path program 1 times [2022-07-20 05:23:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:51,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509122874] [2022-07-20 05:23:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:51,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:51,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:51,538 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:51,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 05:23:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:51,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:23:51,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:51,686 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-20 05:23:51,687 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 11 treesize of output 17 [2022-07-20 05:23:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:23:51,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:23:52,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:52,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509122874] [2022-07-20 05:23:52,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509122874] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:52,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:52,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-20 05:23:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739183930] [2022-07-20 05:23:52,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:52,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:23:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:52,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:23:52,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:23:52,374 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:53,476 INFO L93 Difference]: Finished difference Result 153 states and 186 transitions. [2022-07-20 05:23:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:23:53,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 05:23:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:53,478 INFO L225 Difference]: With dead ends: 153 [2022-07-20 05:23:53,478 INFO L226 Difference]: Without dead ends: 153 [2022-07-20 05:23:53,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:23:53,482 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 123 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:53,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 255 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 226 Invalid, 0 Unknown, 29 Unchecked, 0.8s Time] [2022-07-20 05:23:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-20 05:23:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2022-07-20 05:23:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 120 states have (on average 1.35) internal successors, (162), 133 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2022-07-20 05:23:53,490 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 21 [2022-07-20 05:23:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:53,490 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2022-07-20 05:23:53,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2022-07-20 05:23:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:23:53,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:53,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:53,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:53,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:53,696 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:53,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:53,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1242696241, now seen corresponding path program 1 times [2022-07-20 05:23:53,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:53,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262380302] [2022-07-20 05:23:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:53,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:53,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:53,698 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:53,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 05:23:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:53,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 05:23:53,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:53,814 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 8 treesize of output 7 [2022-07-20 05:23:53,886 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 17 treesize of output 13 [2022-07-20 05:23:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:54,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:54,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:54,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262380302] [2022-07-20 05:23:54,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262380302] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:54,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:54,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-20 05:23:54,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629832329] [2022-07-20 05:23:54,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:54,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:23:54,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:54,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:23:54,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:23:54,355 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:55,320 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2022-07-20 05:23:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:23:55,321 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 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 23 [2022-07-20 05:23:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:55,322 INFO L225 Difference]: With dead ends: 197 [2022-07-20 05:23:55,322 INFO L226 Difference]: Without dead ends: 197 [2022-07-20 05:23:55,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-07-20 05:23:55,323 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 681 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:55,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 386 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 05:23:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-20 05:23:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 125. [2022-07-20 05:23:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 124 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 150 transitions. [2022-07-20 05:23:55,326 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 150 transitions. Word has length 23 [2022-07-20 05:23:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:55,327 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 150 transitions. [2022-07-20 05:23:55,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 150 transitions. [2022-07-20 05:23:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:23:55,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:55,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:55,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-20 05:23:55,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:55,535 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1547664583, now seen corresponding path program 1 times [2022-07-20 05:23:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:55,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004671511] [2022-07-20 05:23:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:55,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:55,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:55,538 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:55,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 05:23:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:55,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 05:23:55,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:55,650 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-20 05:23:55,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:55,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:55,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:55,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:55,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:55,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:55,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:55,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:55,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:55,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:23:55,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:23:55,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-07-20 05:23:55,745 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 45 treesize of output 41 [2022-07-20 05:23:55,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:55,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 26 [2022-07-20 05:23:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:55,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:55,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-20 05:23:55,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:23:56,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:23:56,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:23:56,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:56,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:56,101 INFO L356 Elim1Store]: treesize reduction 303, result has 14.6 percent of original size [2022-07-20 05:23:56,101 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 4 case distinctions, treesize of input 203 treesize of output 95 [2022-07-20 05:23:56,250 INFO L356 Elim1Store]: treesize reduction 359, result has 10.3 percent of original size [2022-07-20 05:23:56,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 115 treesize of output 98 [2022-07-20 05:23:56,269 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-20 05:23:56,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 13 [2022-07-20 05:23:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:56,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:56,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004671511] [2022-07-20 05:23:56,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004671511] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:56,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:23:56,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-20 05:23:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628943953] [2022-07-20 05:23:56,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:56,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:23:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:56,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:23:56,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-07-20 05:23:56,549 INFO L87 Difference]: Start difference. First operand 125 states and 150 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:57,891 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 05:23:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:58,236 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions. [2022-07-20 05:23:58,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:23:58,238 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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 26 [2022-07-20 05:23:58,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:58,239 INFO L225 Difference]: With dead ends: 167 [2022-07-20 05:23:58,239 INFO L226 Difference]: Without dead ends: 167 [2022-07-20 05:23:58,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=127, Unknown=1, NotChecked=24, Total=210 [2022-07-20 05:23:58,240 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 61 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:58,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 225 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 190 Invalid, 0 Unknown, 52 Unchecked, 1.6s Time] [2022-07-20 05:23:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-20 05:23:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 149. [2022-07-20 05:23:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.4148148148148147) internal successors, (191), 148 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 191 transitions. [2022-07-20 05:23:58,244 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 191 transitions. Word has length 26 [2022-07-20 05:23:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:58,244 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 191 transitions. [2022-07-20 05:23:58,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 191 transitions. [2022-07-20 05:23:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:23:58,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:58,245 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:58,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:58,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:58,451 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:58,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:58,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1090844182, now seen corresponding path program 2 times [2022-07-20 05:23:58,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:58,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613840801] [2022-07-20 05:23:58,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:23:58,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:58,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:58,453 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:58,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-20 05:23:58,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:23:58,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:58,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:23:58,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:58,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:23:58,573 INFO L356 Elim1Store]: treesize reduction 43, result has 31.7 percent of original size [2022-07-20 05:23:58,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 31 [2022-07-20 05:23:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:23:58,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:23:58,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:23:58,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613840801] [2022-07-20 05:23:58,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613840801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:58,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:58,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112391738] [2022-07-20 05:23:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:58,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:23:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:58,727 INFO L87 Difference]: Start difference. First operand 149 states and 191 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:58,813 INFO L93 Difference]: Finished difference Result 157 states and 203 transitions. [2022-07-20 05:23:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:23:58,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 05:23:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:58,815 INFO L225 Difference]: With dead ends: 157 [2022-07-20 05:23:58,815 INFO L226 Difference]: Without dead ends: 157 [2022-07-20 05:23:58,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:58,816 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:58,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-07-20 05:23:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-20 05:23:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2022-07-20 05:23:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 139 states have (on average 1.4244604316546763) internal successors, (198), 152 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2022-07-20 05:23:58,819 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 27 [2022-07-20 05:23:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:58,819 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2022-07-20 05:23:58,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:58,819 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2022-07-20 05:23:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:23:58,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:58,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:58,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-20 05:23:59,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:23:59,029 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:23:59,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1090844181, now seen corresponding path program 1 times [2022-07-20 05:23:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:23:59,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497783599] [2022-07-20 05:23:59,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:59,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:23:59,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:23:59,032 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:23:59,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-20 05:23:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:59,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 05:23:59,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:59,209 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 8 treesize of output 7 [2022-07-20 05:23:59,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:59,383 INFO L356 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2022-07-20 05:23:59,383 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 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-20 05:23:59,393 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-20 05:23:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:23:59,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:00,039 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-20 05:24:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:24:00,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:00,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497783599] [2022-07-20 05:24:00,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497783599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:00,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:24:00,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2022-07-20 05:24:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260059845] [2022-07-20 05:24:00,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:00,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:24:00,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:00,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:24:00,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:24:00,774 INFO L87 Difference]: Start difference. First operand 153 states and 198 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:01,369 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2022-07-20 05:24:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:24:01,371 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 05:24:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:01,371 INFO L225 Difference]: With dead ends: 160 [2022-07-20 05:24:01,371 INFO L226 Difference]: Without dead ends: 160 [2022-07-20 05:24:01,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:24:01,372 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 36 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:01,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 324 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 94 Unchecked, 0.5s Time] [2022-07-20 05:24:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-20 05:24:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2022-07-20 05:24:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 142 states have (on average 1.4295774647887325) internal successors, (203), 155 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2022-07-20 05:24:01,375 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 27 [2022-07-20 05:24:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:01,375 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2022-07-20 05:24:01,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2022-07-20 05:24:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:24:01,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:01,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:01,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-20 05:24:01,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:01,577 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:01,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash -397297604, now seen corresponding path program 1 times [2022-07-20 05:24:01,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:01,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878565503] [2022-07-20 05:24:01,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:01,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:01,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:01,579 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:01,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-20 05:24:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:01,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:24:01,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 05:24:08,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:24:08,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:08,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878565503] [2022-07-20 05:24:08,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878565503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:24:08,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:24:08,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:24:08,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690915927] [2022-07-20 05:24:08,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:24:08,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:24:08,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:08,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:24:08,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2022-07-20 05:24:08,036 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:08,100 INFO L93 Difference]: Finished difference Result 171 states and 219 transitions. [2022-07-20 05:24:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:24:08,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-07-20 05:24:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:08,102 INFO L225 Difference]: With dead ends: 171 [2022-07-20 05:24:08,102 INFO L226 Difference]: Without dead ends: 146 [2022-07-20 05:24:08,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2022-07-20 05:24:08,102 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 11 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:08,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 162 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-07-20 05:24:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-20 05:24:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-07-20 05:24:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.4692307692307693) internal successors, (191), 143 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 191 transitions. [2022-07-20 05:24:08,106 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 191 transitions. Word has length 28 [2022-07-20 05:24:08,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:08,106 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 191 transitions. [2022-07-20 05:24:08,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 191 transitions. [2022-07-20 05:24:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:24:08,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:08,107 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:08,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-20 05:24:08,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:08,311 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash 543568763, now seen corresponding path program 1 times [2022-07-20 05:24:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:08,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964695839] [2022-07-20 05:24:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:08,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:08,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:08,314 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:08,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-20 05:24:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:08,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 05:24:08,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:24:08,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:24:08,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:08,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964695839] [2022-07-20 05:24:08,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964695839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:24:08,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:24:08,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:24:08,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803519970] [2022-07-20 05:24:08,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:24:08,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:24:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:08,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:24:08,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:24:08,415 INFO L87 Difference]: Start difference. First operand 144 states and 191 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:08,528 INFO L93 Difference]: Finished difference Result 144 states and 183 transitions. [2022-07-20 05:24:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:24:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 05:24:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:08,529 INFO L225 Difference]: With dead ends: 144 [2022-07-20 05:24:08,529 INFO L226 Difference]: Without dead ends: 144 [2022-07-20 05:24:08,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:24:08,530 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:08,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 87 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:24:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-20 05:24:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-07-20 05:24:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 140 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 181 transitions. [2022-07-20 05:24:08,533 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 181 transitions. Word has length 28 [2022-07-20 05:24:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:08,533 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 181 transitions. [2022-07-20 05:24:08,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 181 transitions. [2022-07-20 05:24:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:24:08,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:08,534 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:08,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-20 05:24:08,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:08,735 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 543568764, now seen corresponding path program 1 times [2022-07-20 05:24:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:08,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261751493] [2022-07-20 05:24:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:08,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:08,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:08,737 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:08,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-20 05:24:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:08,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:24:08,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:24:08,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:24:08,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:08,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261751493] [2022-07-20 05:24:08,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261751493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:24:08,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:24:08,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:24:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509999331] [2022-07-20 05:24:08,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:24:08,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:24:08,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:08,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:24:08,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:24:08,943 INFO L87 Difference]: Start difference. First operand 141 states and 181 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:09,272 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2022-07-20 05:24:09,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:24:09,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 05:24:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:09,275 INFO L225 Difference]: With dead ends: 203 [2022-07-20 05:24:09,275 INFO L226 Difference]: Without dead ends: 203 [2022-07-20 05:24:09,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:24:09,276 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 270 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:09,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 92 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:24:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-20 05:24:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 139. [2022-07-20 05:24:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 138 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 176 transitions. [2022-07-20 05:24:09,279 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 176 transitions. Word has length 28 [2022-07-20 05:24:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:09,279 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 176 transitions. [2022-07-20 05:24:09,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 176 transitions. [2022-07-20 05:24:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:24:09,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:09,280 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:09,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:09,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:09,489 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:09,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:09,490 INFO L85 PathProgramCache]: Analyzing trace with hash 590171529, now seen corresponding path program 3 times [2022-07-20 05:24:09,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:09,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329616245] [2022-07-20 05:24:09,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:24:09,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:09,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:09,491 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:09,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-20 05:24:09,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 05:24:09,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:09,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 05:24:09,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:09,675 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 8 treesize of output 7 [2022-07-20 05:24:09,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:09,874 INFO L356 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2022-07-20 05:24:09,874 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 1 case distinctions, treesize of input 24 treesize of output 30 [2022-07-20 05:24:09,882 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-20 05:24:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:10,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:11,188 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-20 05:24:11,858 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-20 05:24:11,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:11,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329616245] [2022-07-20 05:24:11,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329616245] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:11,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:24:11,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2022-07-20 05:24:11,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796738122] [2022-07-20 05:24:11,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:11,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 05:24:11,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:11,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 05:24:11,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-07-20 05:24:11,860 INFO L87 Difference]: Start difference. First operand 139 states and 176 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:14,922 INFO L93 Difference]: Finished difference Result 240 states and 292 transitions. [2022-07-20 05:24:14,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 05:24:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 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 28 [2022-07-20 05:24:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:14,924 INFO L225 Difference]: With dead ends: 240 [2022-07-20 05:24:14,924 INFO L226 Difference]: Without dead ends: 240 [2022-07-20 05:24:14,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2022-07-20 05:24:14,925 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 291 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:14,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 293 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 397 Invalid, 0 Unknown, 217 Unchecked, 1.6s Time] [2022-07-20 05:24:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-20 05:24:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 215. [2022-07-20 05:24:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 214 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2022-07-20 05:24:14,935 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 28 [2022-07-20 05:24:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:14,936 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2022-07-20 05:24:14,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2022-07-20 05:24:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 05:24:14,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:14,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:14,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:15,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:15,147 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1391261449, now seen corresponding path program 1 times [2022-07-20 05:24:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:15,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523721994] [2022-07-20 05:24:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:15,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:15,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:15,149 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:15,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-20 05:24:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:15,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 05:24:15,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:24:15,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:24:15,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:15,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523721994] [2022-07-20 05:24:15,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523721994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:24:15,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:24:15,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:24:15,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651787178] [2022-07-20 05:24:15,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:24:15,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:24:15,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:15,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:24:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:24:15,263 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:15,278 INFO L93 Difference]: Finished difference Result 216 states and 268 transitions. [2022-07-20 05:24:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:24:15,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 32 [2022-07-20 05:24:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:15,279 INFO L225 Difference]: With dead ends: 216 [2022-07-20 05:24:15,279 INFO L226 Difference]: Without dead ends: 216 [2022-07-20 05:24:15,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:24:15,280 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:15,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:24:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-20 05:24:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-20 05:24:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 205 states have (on average 1.3073170731707318) internal successors, (268), 215 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 268 transitions. [2022-07-20 05:24:15,285 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 268 transitions. Word has length 32 [2022-07-20 05:24:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:15,285 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 268 transitions. [2022-07-20 05:24:15,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 268 transitions. [2022-07-20 05:24:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 05:24:15,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:15,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:15,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-20 05:24:15,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:15,495 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:15,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1391252418, now seen corresponding path program 1 times [2022-07-20 05:24:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:15,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326353344] [2022-07-20 05:24:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:15,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:15,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:15,497 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:15,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-20 05:24:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:15,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:24:15,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:24:15,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:15,978 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 25 treesize of output 21 [2022-07-20 05:24:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:24:16,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:16,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326353344] [2022-07-20 05:24:16,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326353344] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:16,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:24:16,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-07-20 05:24:16,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357869698] [2022-07-20 05:24:16,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:16,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:24:16,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:24:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:24:16,127 INFO L87 Difference]: Start difference. First operand 216 states and 268 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:17,455 INFO L93 Difference]: Finished difference Result 802 states and 1009 transitions. [2022-07-20 05:24:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:24:17,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 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 32 [2022-07-20 05:24:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:17,458 INFO L225 Difference]: With dead ends: 802 [2022-07-20 05:24:17,458 INFO L226 Difference]: Without dead ends: 802 [2022-07-20 05:24:17,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2022-07-20 05:24:17,458 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 832 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:17,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 230 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-20 05:24:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-20 05:24:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 311. [2022-07-20 05:24:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 301 states have (on average 1.3521594684385383) internal successors, (407), 310 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 407 transitions. [2022-07-20 05:24:17,467 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 407 transitions. Word has length 32 [2022-07-20 05:24:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:17,467 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 407 transitions. [2022-07-20 05:24:17,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 407 transitions. [2022-07-20 05:24:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:24:17,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:17,468 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:17,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-20 05:24:17,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:17,679 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:17,679 INFO L85 PathProgramCache]: Analyzing trace with hash 795842271, now seen corresponding path program 2 times [2022-07-20 05:24:17,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:17,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188146197] [2022-07-20 05:24:17,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:24:17,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:17,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:17,681 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:17,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-20 05:24:17,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:24:17,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:17,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:24:17,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:17,811 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-20 05:24:17,821 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 13 treesize of output 15 [2022-07-20 05:24:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 05:24:18,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:20,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:24:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 05:24:20,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:20,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188146197] [2022-07-20 05:24:20,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188146197] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:20,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:24:20,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2022-07-20 05:24:20,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198517149] [2022-07-20 05:24:20,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:20,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:24:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:20,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:24:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:24:20,492 INFO L87 Difference]: Start difference. First operand 311 states and 407 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:20,786 INFO L93 Difference]: Finished difference Result 322 states and 423 transitions. [2022-07-20 05:24:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:24:20,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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 33 [2022-07-20 05:24:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:20,788 INFO L225 Difference]: With dead ends: 322 [2022-07-20 05:24:20,788 INFO L226 Difference]: Without dead ends: 322 [2022-07-20 05:24:20,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:24:20,789 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:20,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 139 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-07-20 05:24:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-20 05:24:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 304. [2022-07-20 05:24:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 295 states have (on average 1.352542372881356) internal successors, (399), 303 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 399 transitions. [2022-07-20 05:24:20,797 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 399 transitions. Word has length 33 [2022-07-20 05:24:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:20,797 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 399 transitions. [2022-07-20 05:24:20,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 399 transitions. [2022-07-20 05:24:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:24:20,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:20,798 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1] [2022-07-20 05:24:20,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-20 05:24:20,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:20,999 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:20,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash -563143139, now seen corresponding path program 3 times [2022-07-20 05:24:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:20,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368329678] [2022-07-20 05:24:21,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:24:21,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:21,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:21,001 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:21,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-20 05:24:21,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-20 05:24:21,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:21,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 05:24:21,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:21,156 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 8 treesize of output 7 [2022-07-20 05:24:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:21,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:24,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:24,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368329678] [2022-07-20 05:24:24,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368329678] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:24,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:24:24,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2022-07-20 05:24:24,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680649693] [2022-07-20 05:24:24,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:24,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 05:24:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:24,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 05:24:24,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2022-07-20 05:24:24,681 INFO L87 Difference]: Start difference. First operand 304 states and 399 transitions. Second operand has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:43,276 INFO L93 Difference]: Finished difference Result 1193 states and 1602 transitions. [2022-07-20 05:24:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-20 05:24:43,277 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 05:24:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:43,280 INFO L225 Difference]: With dead ends: 1193 [2022-07-20 05:24:43,280 INFO L226 Difference]: Without dead ends: 1193 [2022-07-20 05:24:43,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=547, Invalid=1259, Unknown=0, NotChecked=0, Total=1806 [2022-07-20 05:24:43,281 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 1453 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:43,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 2006 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1623 Invalid, 0 Unknown, 25 Unchecked, 6.1s Time] [2022-07-20 05:24:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2022-07-20 05:24:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 336. [2022-07-20 05:24:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 327 states have (on average 1.342507645259939) internal successors, (439), 335 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 439 transitions. [2022-07-20 05:24:43,291 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 439 transitions. Word has length 34 [2022-07-20 05:24:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:43,291 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 439 transitions. [2022-07-20 05:24:43,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 439 transitions. [2022-07-20 05:24:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:24:43,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:43,292 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:43,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:43,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:43,502 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:43,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1267793515, now seen corresponding path program 1 times [2022-07-20 05:24:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:43,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32729644] [2022-07-20 05:24:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:43,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:43,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:43,504 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:43,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-20 05:24:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:43,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:24:43,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:24:43,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:24:43,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:43,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32729644] [2022-07-20 05:24:43,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32729644] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:43,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:24:43,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 05:24:43,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245051038] [2022-07-20 05:24:43,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:43,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:24:43,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:43,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:24:43,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:24:43,701 INFO L87 Difference]: Start difference. First operand 336 states and 439 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:43,944 INFO L93 Difference]: Finished difference Result 320 states and 404 transitions. [2022-07-20 05:24:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:24:43,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 05:24:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:43,946 INFO L225 Difference]: With dead ends: 320 [2022-07-20 05:24:43,946 INFO L226 Difference]: Without dead ends: 320 [2022-07-20 05:24:43,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:24:43,947 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:43,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 149 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:24:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-20 05:24:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 309. [2022-07-20 05:24:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 300 states have (on average 1.31) internal successors, (393), 308 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 393 transitions. [2022-07-20 05:24:43,960 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 393 transitions. Word has length 34 [2022-07-20 05:24:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:43,960 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 393 transitions. [2022-07-20 05:24:43,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 393 transitions. [2022-07-20 05:24:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:24:43,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:43,961 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:43,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:44,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:44,172 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash 717604305, now seen corresponding path program 4 times [2022-07-20 05:24:44,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:44,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841001833] [2022-07-20 05:24:44,173 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:24:44,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:44,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:44,175 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:44,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-20 05:24:44,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:24:44,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:44,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 05:24:44,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:44,430 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-20 05:24:44,430 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 11 treesize of output 17 [2022-07-20 05:24:44,663 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 24 treesize of output 18 [2022-07-20 05:24:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:24:44,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:24:45,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:45,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841001833] [2022-07-20 05:24:45,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841001833] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:45,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:24:45,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2022-07-20 05:24:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090346782] [2022-07-20 05:24:45,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:45,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 05:24:45,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:45,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 05:24:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-07-20 05:24:45,613 INFO L87 Difference]: Start difference. First operand 309 states and 393 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:52,022 INFO L93 Difference]: Finished difference Result 685 states and 891 transitions. [2022-07-20 05:24:52,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-20 05:24:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 05:24:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:52,025 INFO L225 Difference]: With dead ends: 685 [2022-07-20 05:24:52,025 INFO L226 Difference]: Without dead ends: 685 [2022-07-20 05:24:52,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=663, Invalid=2417, Unknown=0, NotChecked=0, Total=3080 [2022-07-20 05:24:52,026 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1560 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:52,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 894 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-20 05:24:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-07-20 05:24:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 500. [2022-07-20 05:24:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 491 states have (on average 1.3441955193482689) internal successors, (660), 499 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 660 transitions. [2022-07-20 05:24:52,041 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 660 transitions. Word has length 36 [2022-07-20 05:24:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:52,041 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 660 transitions. [2022-07-20 05:24:52,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 660 transitions. [2022-07-20 05:24:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 05:24:52,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:52,042 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:52,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:52,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:52,253 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash -411523054, now seen corresponding path program 5 times [2022-07-20 05:24:52,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:52,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512888633] [2022-07-20 05:24:52,254 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:24:52,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:52,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:52,255 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:52,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-20 05:24:52,524 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-20 05:24:52,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:52,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 05:24:52,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:52,547 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 8 treesize of output 7 [2022-07-20 05:24:52,896 INFO L356 Elim1Store]: treesize reduction 50, result has 20.6 percent of original size [2022-07-20 05:24:52,896 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 2 case distinctions, treesize of input 26 treesize of output 28 [2022-07-20 05:24:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:53,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:55,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:24:55,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512888633] [2022-07-20 05:24:55,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512888633] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:55,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:24:55,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2022-07-20 05:24:55,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848553608] [2022-07-20 05:24:55,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:55,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 05:24:55,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:24:55,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 05:24:55,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:24:55,516 INFO L87 Difference]: Start difference. First operand 500 states and 660 transitions. Second operand has 30 states, 29 states have (on average 2.689655172413793) internal successors, (78), 30 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:59,578 INFO L93 Difference]: Finished difference Result 543 states and 710 transitions. [2022-07-20 05:24:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-20 05:24:59,579 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.689655172413793) internal successors, (78), 30 states have internal predecessors, (78), 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 40 [2022-07-20 05:24:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:59,580 INFO L225 Difference]: With dead ends: 543 [2022-07-20 05:24:59,580 INFO L226 Difference]: Without dead ends: 543 [2022-07-20 05:24:59,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=501, Invalid=1949, Unknown=0, NotChecked=0, Total=2450 [2022-07-20 05:24:59,581 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 43 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:59,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 394 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 257 Unchecked, 0.1s Time] [2022-07-20 05:24:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-20 05:24:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 518. [2022-07-20 05:24:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 509 states have (on average 1.337917485265226) internal successors, (681), 517 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 681 transitions. [2022-07-20 05:24:59,597 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 681 transitions. Word has length 40 [2022-07-20 05:24:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:59,598 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 681 transitions. [2022-07-20 05:24:59,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.689655172413793) internal successors, (78), 30 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 681 transitions. [2022-07-20 05:24:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 05:24:59,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:59,601 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:59,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:59,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:24:59,813 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:24:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:59,814 INFO L85 PathProgramCache]: Analyzing trace with hash -282034220, now seen corresponding path program 6 times [2022-07-20 05:24:59,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:24:59,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329801550] [2022-07-20 05:24:59,814 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:24:59,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:24:59,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:24:59,815 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:24:59,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-20 05:25:00,012 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-20 05:25:00,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:00,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 05:25:00,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:00,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:00,061 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 11 treesize of output 13 [2022-07-20 05:25:00,064 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-20 05:25:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 05:25:00,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:01,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 05:25:01,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:01,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329801550] [2022-07-20 05:25:01,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329801550] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:01,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:25:01,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2022-07-20 05:25:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753524486] [2022-07-20 05:25:01,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:01,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:25:01,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:01,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:25:01,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:25:01,851 INFO L87 Difference]: Start difference. First operand 518 states and 681 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:05,989 INFO L93 Difference]: Finished difference Result 941 states and 1246 transitions. [2022-07-20 05:25:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:25:05,990 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 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 40 [2022-07-20 05:25:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:05,992 INFO L225 Difference]: With dead ends: 941 [2022-07-20 05:25:05,992 INFO L226 Difference]: Without dead ends: 941 [2022-07-20 05:25:05,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2022-07-20 05:25:05,993 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 876 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:05,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 552 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 757 Invalid, 0 Unknown, 147 Unchecked, 1.8s Time] [2022-07-20 05:25:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-20 05:25:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 699. [2022-07-20 05:25:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 690 states have (on average 1.3420289855072465) internal successors, (926), 698 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 926 transitions. [2022-07-20 05:25:06,004 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 926 transitions. Word has length 40 [2022-07-20 05:25:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:06,005 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 926 transitions. [2022-07-20 05:25:06,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 926 transitions. [2022-07-20 05:25:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 05:25:06,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:06,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:06,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:06,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:25:06,218 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:25:06,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 306205251, now seen corresponding path program 1 times [2022-07-20 05:25:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:25:06,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582455656] [2022-07-20 05:25:06,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:06,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:25:06,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:25:06,220 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:25:06,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-20 05:25:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:06,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 05:25:06,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:06,362 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 8 treesize of output 7 [2022-07-20 05:25:06,431 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 17 treesize of output 13 [2022-07-20 05:25:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 05:25:06,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 05:25:07,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:07,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582455656] [2022-07-20 05:25:07,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582455656] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:07,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:25:07,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-20 05:25:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446261902] [2022-07-20 05:25:07,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:07,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 05:25:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:07,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 05:25:07,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-07-20 05:25:07,039 INFO L87 Difference]: Start difference. First operand 699 states and 926 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:08,117 INFO L93 Difference]: Finished difference Result 947 states and 1263 transitions. [2022-07-20 05:25:08,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:25:08,118 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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 44 [2022-07-20 05:25:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:08,131 INFO L225 Difference]: With dead ends: 947 [2022-07-20 05:25:08,132 INFO L226 Difference]: Without dead ends: 947 [2022-07-20 05:25:08,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2022-07-20 05:25:08,133 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 764 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:08,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 386 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 05:25:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-20 05:25:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 858. [2022-07-20 05:25:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 849 states have (on average 1.3769140164899882) internal successors, (1169), 857 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1169 transitions. [2022-07-20 05:25:08,144 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1169 transitions. Word has length 44 [2022-07-20 05:25:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:08,144 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1169 transitions. [2022-07-20 05:25:08,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1169 transitions. [2022-07-20 05:25:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 05:25:08,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:08,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:08,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:08,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:25:08,356 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:25:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1599170913, now seen corresponding path program 1 times [2022-07-20 05:25:08,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:25:08,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470157667] [2022-07-20 05:25:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:08,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:25:08,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:25:08,358 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:25:08,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-20 05:25:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:08,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 05:25:08,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:08,504 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 8 treesize of output 7 [2022-07-20 05:25:08,661 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 17 treesize of output 13 [2022-07-20 05:25:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:25:08,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:25:09,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:09,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470157667] [2022-07-20 05:25:09,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470157667] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:09,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:25:09,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-20 05:25:09,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478842513] [2022-07-20 05:25:09,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:09,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 05:25:09,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:09,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 05:25:09,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2022-07-20 05:25:09,599 INFO L87 Difference]: Start difference. First operand 858 states and 1169 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:11,583 INFO L93 Difference]: Finished difference Result 1289 states and 1744 transitions. [2022-07-20 05:25:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:25:11,584 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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 45 [2022-07-20 05:25:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:11,587 INFO L225 Difference]: With dead ends: 1289 [2022-07-20 05:25:11,587 INFO L226 Difference]: Without dead ends: 1289 [2022-07-20 05:25:11,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=392, Invalid=1330, Unknown=0, NotChecked=0, Total=1722 [2022-07-20 05:25:11,588 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 895 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:11,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 791 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-20 05:25:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-07-20 05:25:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 872. [2022-07-20 05:25:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 863 states have (on average 1.3684820393974508) internal successors, (1181), 871 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1181 transitions. [2022-07-20 05:25:11,600 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1181 transitions. Word has length 45 [2022-07-20 05:25:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:11,601 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1181 transitions. [2022-07-20 05:25:11,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1181 transitions. [2022-07-20 05:25:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 05:25:11,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:11,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:11,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:11,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:25:11,813 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:25:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:11,813 INFO L85 PathProgramCache]: Analyzing trace with hash -484234273, now seen corresponding path program 2 times [2022-07-20 05:25:11,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:25:11,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865599219] [2022-07-20 05:25:11,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:25:11,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:25:11,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:25:11,814 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:25:11,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-20 05:25:11,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:25:11,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:11,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 05:25:11,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:11,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:25:11,928 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 8 treesize of output 7 [2022-07-20 05:25:12,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:12,088 INFO L356 Elim1Store]: treesize reduction 28, result has 34.9 percent of original size [2022-07-20 05:25:12,088 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 2 case distinctions, treesize of input 19 treesize of output 27 [2022-07-20 05:25:12,100 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:25:12,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:25:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-20 05:25:12,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:19,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-20 05:25:19,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:19,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865599219] [2022-07-20 05:25:19,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865599219] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:19,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:25:19,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-20 05:25:19,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967283827] [2022-07-20 05:25:19,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:19,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:25:19,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:25:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2022-07-20 05:25:19,863 INFO L87 Difference]: Start difference. First operand 872 states and 1181 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:20,449 INFO L93 Difference]: Finished difference Result 873 states and 1169 transitions. [2022-07-20 05:25:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:25:20,450 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 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 45 [2022-07-20 05:25:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:20,452 INFO L225 Difference]: With dead ends: 873 [2022-07-20 05:25:20,452 INFO L226 Difference]: Without dead ends: 873 [2022-07-20 05:25:20,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=71, Invalid=200, Unknown=1, NotChecked=0, Total=272 [2022-07-20 05:25:20,453 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 74 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:20,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 110 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2022-07-20 05:25:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-07-20 05:25:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 872. [2022-07-20 05:25:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 863 states have (on average 1.354577056778679) internal successors, (1169), 871 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1169 transitions. [2022-07-20 05:25:20,464 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1169 transitions. Word has length 45 [2022-07-20 05:25:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:20,464 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1169 transitions. [2022-07-20 05:25:20,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1169 transitions. [2022-07-20 05:25:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 05:25:20,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:20,465 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:20,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:20,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:25:20,675 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:25:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2126360568, now seen corresponding path program 1 times [2022-07-20 05:25:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:25:20,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864697390] [2022-07-20 05:25:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:20,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:25:20,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:25:20,676 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:25:20,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-20 05:25:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:20,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:25:20,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 05:25:20,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:21,192 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 25 treesize of output 21 [2022-07-20 05:25:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 05:25:21,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:21,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864697390] [2022-07-20 05:25:21,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864697390] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:21,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:25:21,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-20 05:25:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540347747] [2022-07-20 05:25:21,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:21,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:25:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:25:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:25:21,535 INFO L87 Difference]: Start difference. First operand 872 states and 1169 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:22,399 INFO L93 Difference]: Finished difference Result 1105 states and 1421 transitions. [2022-07-20 05:25:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:25:22,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 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 46 [2022-07-20 05:25:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:22,403 INFO L225 Difference]: With dead ends: 1105 [2022-07-20 05:25:22,403 INFO L226 Difference]: Without dead ends: 1105 [2022-07-20 05:25:22,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2022-07-20 05:25:22,406 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 489 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:22,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 163 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 05:25:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2022-07-20 05:25:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 872. [2022-07-20 05:25:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 863 states have (on average 1.320973348783314) internal successors, (1140), 871 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1140 transitions. [2022-07-20 05:25:22,416 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1140 transitions. Word has length 46 [2022-07-20 05:25:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:22,416 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1140 transitions. [2022-07-20 05:25:22,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1140 transitions. [2022-07-20 05:25:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 05:25:22,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:22,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:22,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:22,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:25:22,628 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:25:22,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:22,629 INFO L85 PathProgramCache]: Analyzing trace with hash -326352172, now seen corresponding path program 1 times [2022-07-20 05:25:22,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:25:22,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109007275] [2022-07-20 05:25:22,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:22,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:25:22,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:25:22,631 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:25:22,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-20 05:25:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:22,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:25:22,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:22,830 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-20 05:25:22,830 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 11 treesize of output 17 [2022-07-20 05:25:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-20 05:25:23,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-20 05:25:24,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:24,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109007275] [2022-07-20 05:25:24,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109007275] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:24,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:25:24,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2022-07-20 05:25:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535587610] [2022-07-20 05:25:24,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:24,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:25:24,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:24,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:25:24,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:25:24,069 INFO L87 Difference]: Start difference. First operand 872 states and 1140 transitions. Second operand has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:25,909 INFO L93 Difference]: Finished difference Result 872 states and 1137 transitions. [2022-07-20 05:25:25,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:25:25,910 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 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 46 [2022-07-20 05:25:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:25,912 INFO L225 Difference]: With dead ends: 872 [2022-07-20 05:25:25,912 INFO L226 Difference]: Without dead ends: 872 [2022-07-20 05:25:25,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:25:25,913 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 44 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:25,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 148 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 48 Unchecked, 0.2s Time] [2022-07-20 05:25:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2022-07-20 05:25:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2022-07-20 05:25:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 863 states have (on average 1.3174971031286211) internal successors, (1137), 871 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1137 transitions. [2022-07-20 05:25:25,923 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1137 transitions. Word has length 46 [2022-07-20 05:25:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:25,923 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1137 transitions. [2022-07-20 05:25:25,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1137 transitions. [2022-07-20 05:25:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 05:25:25,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:25,925 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:25,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:26,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:25:26,136 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:25:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1349955383, now seen corresponding path program 1 times [2022-07-20 05:25:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:25:26,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668024369] [2022-07-20 05:25:26,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:26,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:25:26,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:25:26,138 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:25:26,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-20 05:25:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:26,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:25:26,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 05:25:32,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:25:32,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:32,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668024369] [2022-07-20 05:25:32,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668024369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:25:32,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:25:32,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:25:32,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244680282] [2022-07-20 05:25:32,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:25:32,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:25:32,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:32,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:25:32,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2022-07-20 05:25:32,955 INFO L87 Difference]: Start difference. First operand 872 states and 1137 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:32,987 INFO L93 Difference]: Finished difference Result 1104 states and 1443 transitions. [2022-07-20 05:25:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:25:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-20 05:25:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:32,990 INFO L225 Difference]: With dead ends: 1104 [2022-07-20 05:25:32,990 INFO L226 Difference]: Without dead ends: 1082 [2022-07-20 05:25:32,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2022-07-20 05:25:32,991 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:32,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 180 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2022-07-20 05:25:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2022-07-20 05:25:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1007. [2022-07-20 05:25:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 998 states have (on average 1.3356713426853708) internal successors, (1333), 1006 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1333 transitions. [2022-07-20 05:25:33,002 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1333 transitions. Word has length 50 [2022-07-20 05:25:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:33,003 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1333 transitions. [2022-07-20 05:25:33,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1333 transitions. [2022-07-20 05:25:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 05:25:33,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:33,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:33,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:33,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:25:33,216 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:25:33,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1278180873, now seen corresponding path program 3 times [2022-07-20 05:25:33,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:25:33,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129408040] [2022-07-20 05:25:33,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:25:33,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:25:33,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:25:33,218 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:25:33,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-07-20 05:25:33,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-20 05:25:33,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:33,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:25:33,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-20 05:25:33,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:33,673 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-20 05:25:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-20 05:25:34,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:34,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129408040] [2022-07-20 05:25:34,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129408040] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:34,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:25:34,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-20 05:25:34,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900450393] [2022-07-20 05:25:34,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:34,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:25:34,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:34,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:25:34,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:25:34,016 INFO L87 Difference]: Start difference. First operand 1007 states and 1333 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:34,951 INFO L93 Difference]: Finished difference Result 1349 states and 1730 transitions. [2022-07-20 05:25:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:25:34,953 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-20 05:25:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:34,956 INFO L225 Difference]: With dead ends: 1349 [2022-07-20 05:25:34,956 INFO L226 Difference]: Without dead ends: 1349 [2022-07-20 05:25:34,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:25:34,957 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 373 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:34,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 181 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 05:25:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2022-07-20 05:25:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1006. [2022-07-20 05:25:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 998 states have (on average 1.2895791583166332) internal successors, (1287), 1005 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1287 transitions. [2022-07-20 05:25:34,968 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1287 transitions. Word has length 52 [2022-07-20 05:25:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:34,970 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1287 transitions. [2022-07-20 05:25:34,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1287 transitions. [2022-07-20 05:25:34,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 05:25:34,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:34,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:34,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:35,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:25:35,182 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:25:35,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:35,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1986422419, now seen corresponding path program 1 times [2022-07-20 05:25:35,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:25:35,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173995108] [2022-07-20 05:25:35,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:35,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:25:35,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:25:35,185 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:25:35,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-07-20 05:25:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:35,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 05:25:35,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:35,446 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-20 05:25:35,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:35,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:35,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2022-07-20 05:25:35,530 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 58 treesize of output 54 [2022-07-20 05:25:35,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:35,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:35,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:35,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 30 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 91 [2022-07-20 05:25:35,747 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 85 treesize of output 73 [2022-07-20 05:25:36,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:36,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 115 treesize of output 51 [2022-07-20 05:25:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:25:36,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:36,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (bvadd (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32))))) is different from false [2022-07-20 05:25:36,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 7 0) (_ bv1 32))) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1 (_ bv1 32)) ((_ extract 15 8) (_ bv1 32))) (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 23 16) (_ bv1 32))) (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 31 24) (_ bv1 32))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (bvadd (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32))))) is different from false [2022-07-20 05:25:36,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 7 0) (_ bv1 32))) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1 (_ bv5 32)) ((_ extract 15 8) (_ bv1 32))) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 23 16) (_ bv1 32))) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32) .cse1) ((_ extract 31 24) (_ bv1 32))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (bvadd (_ bv1 32) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)))))) is different from false [2022-07-20 05:25:37,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1421))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) ((_ extract 7 0) (_ bv1 32))) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 (_ bv5 32)) ((_ extract 15 8) (_ bv1 32))) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) ((_ extract 23 16) (_ bv1 32))) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32) .cse2) ((_ extract 31 24) (_ bv1 32)))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (bvadd (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32))))) is different from false [2022-07-20 05:25:37,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:37,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:37,200 INFO L356 Elim1Store]: treesize reduction 303, result has 14.6 percent of original size [2022-07-20 05:25:37,200 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 4 case distinctions, treesize of input 1103 treesize of output 515 [2022-07-20 05:25:37,206 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 861 treesize of output 837 [2022-07-20 05:25:37,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 15393 treesize of output 11553 [2022-07-20 05:25:37,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 11951 treesize of output 11891 [2022-07-20 05:25:37,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:37,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:38,195 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:38,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 58 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 8 case distinctions, treesize of input 15408 treesize of output 11657 [2022-07-20 05:25:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 5 not checked. [2022-07-20 05:25:41,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:41,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173995108] [2022-07-20 05:25:41,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173995108] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:41,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:25:41,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-20 05:25:41,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558116150] [2022-07-20 05:25:41,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:41,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 05:25:41,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:41,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 05:25:41,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=292, Unknown=4, NotChecked=148, Total=506 [2022-07-20 05:25:41,659 INFO L87 Difference]: Start difference. First operand 1006 states and 1287 transitions. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:45,165 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 05:25:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:46,654 INFO L93 Difference]: Finished difference Result 1071 states and 1349 transitions. [2022-07-20 05:25:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:25:46,655 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-20 05:25:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:46,657 INFO L225 Difference]: With dead ends: 1071 [2022-07-20 05:25:46,657 INFO L226 Difference]: Without dead ends: 1071 [2022-07-20 05:25:46,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=174, Invalid=650, Unknown=4, NotChecked=228, Total=1056 [2022-07-20 05:25:46,658 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 205 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:46,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 432 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 505 Invalid, 1 Unknown, 402 Unchecked, 3.3s Time] [2022-07-20 05:25:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2022-07-20 05:25:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 976. [2022-07-20 05:25:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 968 states have (on average 1.2882231404958677) internal successors, (1247), 975 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1247 transitions. [2022-07-20 05:25:46,667 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1247 transitions. Word has length 53 [2022-07-20 05:25:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:46,667 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1247 transitions. [2022-07-20 05:25:46,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1247 transitions. [2022-07-20 05:25:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 05:25:46,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:46,668 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:46,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Ended with exit code 0 [2022-07-20 05:25:46,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:25:46,881 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:25:46,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:46,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1956787805, now seen corresponding path program 1 times [2022-07-20 05:25:46,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:25:46,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795323847] [2022-07-20 05:25:46,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:46,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:25:46,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:25:46,883 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:25:46,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-07-20 05:25:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:47,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:25:47,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-20 05:25:47,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-20 05:25:47,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:47,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795323847] [2022-07-20 05:25:47,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795323847] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:47,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:25:47,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 05:25:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680571582] [2022-07-20 05:25:47,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:47,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:25:47,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:47,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:25:47,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:25:47,107 INFO L87 Difference]: Start difference. First operand 976 states and 1247 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:47,526 INFO L93 Difference]: Finished difference Result 1111 states and 1391 transitions. [2022-07-20 05:25:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:25:47,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-20 05:25:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:47,529 INFO L225 Difference]: With dead ends: 1111 [2022-07-20 05:25:47,530 INFO L226 Difference]: Without dead ends: 1111 [2022-07-20 05:25:47,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:25:47,530 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 191 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:47,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 154 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:25:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-07-20 05:25:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1012. [2022-07-20 05:25:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1004 states have (on average 1.2639442231075697) internal successors, (1269), 1011 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1269 transitions. [2022-07-20 05:25:47,538 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1269 transitions. Word has length 55 [2022-07-20 05:25:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:47,538 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1269 transitions. [2022-07-20 05:25:47,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1269 transitions. [2022-07-20 05:25:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 05:25:47,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:47,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:47,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:47,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:25:47,740 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:25:47,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:47,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1472253864, now seen corresponding path program 1 times [2022-07-20 05:25:47,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:25:47,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6247462] [2022-07-20 05:25:47,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:47,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:25:47,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:25:47,742 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:25:47,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-07-20 05:25:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:48,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 05:25:48,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:48,054 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-20 05:25:48,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:48,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:48,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2022-07-20 05:25:48,141 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 58 treesize of output 54 [2022-07-20 05:25:48,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 87 [2022-07-20 05:25:48,346 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 45 treesize of output 41 [2022-07-20 05:25:48,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:48,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 87 [2022-07-20 05:25:48,832 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 45 treesize of output 41 [2022-07-20 05:25:48,986 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:48,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 26 [2022-07-20 05:25:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 05:25:49,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:49,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-20 05:25:49,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1 (_ bv1 32)) v_ArrVal_1545) (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) v_ArrVal_1547) (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) v_ArrVal_1543))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-20 05:25:49,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)) v_ArrVal_1545) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1547) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32)) v_ArrVal_1543)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-20 05:25:49,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1542))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)) v_ArrVal_1545) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1547) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32)) v_ArrVal_1543))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-20 05:25:49,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1537 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1541 (_ BitVec 8)) (v_ArrVal_1540 (_ BitVec 8)) (v_ArrVal_1539 (_ BitVec 8)) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_1539) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 (_ bv1 32)) v_ArrVal_1541) (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_1540) (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_1537))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1542))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)) v_ArrVal_1545) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1547) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32)) v_ArrVal_1543))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-20 05:25:49,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1537 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1541 (_ BitVec 8)) (v_ArrVal_1540 (_ BitVec 8)) (v_ArrVal_1539 (_ BitVec 8)) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_1539) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 (_ bv5 32)) v_ArrVal_1541) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_1540) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32) .cse2) v_ArrVal_1537))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1542))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)) v_ArrVal_1545) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1547) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32)) v_ArrVal_1543))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-20 05:25:49,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1537 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1541 (_ BitVec 8)) (v_ArrVal_1540 (_ BitVec 8)) (v_ArrVal_1536 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1539 (_ BitVec 8)) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1536))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3) v_ArrVal_1539) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3 (_ bv5 32)) v_ArrVal_1541) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3) v_ArrVal_1540) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32) .cse3) v_ArrVal_1537)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1542))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)) v_ArrVal_1545) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1547) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32)) v_ArrVal_1543))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-20 05:25:49,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:49,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:49,626 INFO L356 Elim1Store]: treesize reduction 303, result has 14.6 percent of original size [2022-07-20 05:25:49,627 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 4 case distinctions, treesize of input 1151 treesize of output 563 [2022-07-20 05:25:49,636 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 569 treesize of output 553 [2022-07-20 05:25:49,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 715 treesize of output 603 [2022-07-20 05:25:49,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 859 treesize of output 803 [2022-07-20 05:25:49,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 803 treesize of output 775 [2022-07-20 05:25:49,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:49,875 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:49,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 718 treesize of output 636 [2022-07-20 05:25:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2022-07-20 05:25:59,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:25:59,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6247462] [2022-07-20 05:25:59,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6247462] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:59,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:25:59,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2022-07-20 05:25:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588396071] [2022-07-20 05:25:59,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:59,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:25:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:25:59,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:25:59,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=146, Unknown=7, NotChecked=210, Total=420 [2022-07-20 05:25:59,506 INFO L87 Difference]: Start difference. First operand 1012 states and 1269 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:00,569 INFO L93 Difference]: Finished difference Result 1228 states and 1542 transitions. [2022-07-20 05:26:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:26:00,570 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 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 55 [2022-07-20 05:26:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:00,573 INFO L225 Difference]: With dead ends: 1228 [2022-07-20 05:26:00,573 INFO L226 Difference]: Without dead ends: 1228 [2022-07-20 05:26:00,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=260, Unknown=7, NotChecked=280, Total=650 [2022-07-20 05:26:00,574 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 90 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:00,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 254 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 262 Invalid, 0 Unknown, 369 Unchecked, 0.7s Time] [2022-07-20 05:26:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2022-07-20 05:26:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 969. [2022-07-20 05:26:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 961 states have (on average 1.2611862643080125) internal successors, (1212), 968 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1212 transitions. [2022-07-20 05:26:00,582 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1212 transitions. Word has length 55 [2022-07-20 05:26:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:00,583 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1212 transitions. [2022-07-20 05:26:00,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1212 transitions. [2022-07-20 05:26:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 05:26:00,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:00,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:00,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Ended with exit code 0 [2022-07-20 05:26:00,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:26:00,787 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:26:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash -581803496, now seen corresponding path program 1 times [2022-07-20 05:26:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:26:00,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168199633] [2022-07-20 05:26:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:26:00,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:26:00,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:26:00,789 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:26:00,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-07-20 05:26:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:26:00,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 05:26:00,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:01,012 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-20 05:26:01,012 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 11 treesize of output 17 [2022-07-20 05:26:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-20 05:26:01,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:26:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-20 05:26:02,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:26:02,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168199633] [2022-07-20 05:26:02,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168199633] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:26:02,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:26:02,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2022-07-20 05:26:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780900608] [2022-07-20 05:26:02,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:26:02,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 05:26:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:26:02,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 05:26:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:26:02,872 INFO L87 Difference]: Start difference. First operand 969 states and 1212 transitions. Second operand has 17 states, 16 states have (on average 5.875) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:04,526 INFO L93 Difference]: Finished difference Result 1186 states and 1482 transitions. [2022-07-20 05:26:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:26:04,526 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.875) internal successors, (94), 17 states have internal predecessors, (94), 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 56 [2022-07-20 05:26:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:04,529 INFO L225 Difference]: With dead ends: 1186 [2022-07-20 05:26:04,529 INFO L226 Difference]: Without dead ends: 1186 [2022-07-20 05:26:04,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:26:04,529 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 175 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:04,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 319 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 230 Unchecked, 1.2s Time] [2022-07-20 05:26:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-07-20 05:26:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1083. [2022-07-20 05:26:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1075 states have (on average 1.2632558139534884) internal successors, (1358), 1082 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1358 transitions. [2022-07-20 05:26:04,540 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1358 transitions. Word has length 56 [2022-07-20 05:26:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:04,541 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1358 transitions. [2022-07-20 05:26:04,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.875) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1358 transitions. [2022-07-20 05:26:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 05:26:04,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:04,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:04,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-07-20 05:26:04,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:26:04,753 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:26:04,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:04,754 INFO L85 PathProgramCache]: Analyzing trace with hash -259775269, now seen corresponding path program 1 times [2022-07-20 05:26:04,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:26:04,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512117364] [2022-07-20 05:26:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:26:04,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:26:04,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:26:04,756 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:26:04,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-07-20 05:26:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:26:04,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-20 05:26:05,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:05,049 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-20 05:26:05,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:05,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:05,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2022-07-20 05:26:05,127 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 58 treesize of output 54 [2022-07-20 05:26:05,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 87 [2022-07-20 05:26:05,283 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 45 treesize of output 41 [2022-07-20 05:26:05,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:05,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 123 [2022-07-20 05:26:05,773 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 153 treesize of output 133 [2022-07-20 05:26:06,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:26:06,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 175 treesize of output 95 [2022-07-20 05:26:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:26:06,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:26:06,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)))))) is different from false [2022-07-20 05:26:06,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|)) (.cse2 (bvadd |c_ULTIMATE.start_lis_#t~mem12#1| (_ bv1 32)))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 7 0) .cse2)) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1 (_ bv1 32)) ((_ extract 15 8) .cse2)) (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 23 16) .cse2)) (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 31 24) .cse2)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)))))) is different from false [2022-07-20 05:26:07,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|)) (.cse3 (bvadd (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~j~0#1|))) (concat (concat (concat (select .cse1 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse4)) (select .cse1 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse4))) (select .cse1 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse4 (_ bv1 32)))) (select .cse1 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse4)))) (_ bv1 32)))) (store (store (store (store .cse1 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) ((_ extract 7 0) .cse3)) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 (_ bv1 32)) ((_ extract 15 8) .cse3)) (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) ((_ extract 23 16) .cse3)) (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) ((_ extract 31 24) .cse3))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)))))) is different from false [2022-07-20 05:26:07,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse1 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse2 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse3 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse5 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|)) (.cse6 (bvadd (concat (concat (concat (select .cse4 .cse1) (select .cse4 .cse2)) (select .cse4 .cse3)) (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32)))) (store (store (store (store .cse4 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse5) ((_ extract 7 0) .cse6)) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse5 (_ bv1 32)) ((_ extract 15 8) .cse6)) (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse5) ((_ extract 23 16) .cse6)) (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse5) ((_ extract 31 24) .cse6))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))))))) is different from false [2022-07-20 05:26:07,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse6 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32))) (.cse5 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse4 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (.cse1 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse2 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse3 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse9 (bvadd (concat (concat (concat (select .cse8 .cse1) (select .cse8 .cse2)) (select .cse8 .cse3)) (select .cse8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32)))) (store (store (store (store .cse8 .cse7 ((_ extract 7 0) .cse9)) .cse6 ((_ extract 15 8) .cse9)) .cse5 ((_ extract 23 16) .cse9)) .cse4 ((_ extract 31 24) .cse9))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (concat (concat (concat (select .cse0 .cse4) (select .cse0 .cse5)) (select .cse0 .cse6)) (select .cse0 .cse7)))))) is different from false [2022-07-20 05:26:07,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse6 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32))) (.cse5 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse4 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (.cse1 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse2 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse3 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (let ((.cse0 (select (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1671))) (store .cse8 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse10 (bvadd (concat (concat (concat (select .cse9 .cse1) (select .cse9 .cse2)) (select .cse9 .cse3)) (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32)))) (store (store (store (store .cse9 .cse7 ((_ extract 7 0) .cse10)) .cse6 ((_ extract 15 8) .cse10)) .cse5 ((_ extract 23 16) .cse10)) .cse4 ((_ extract 31 24) .cse10)))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (concat (concat (concat (select .cse0 .cse4) (select .cse0 .cse5)) (select .cse0 .cse6)) (select .cse0 .cse7)))))) is different from false [2022-07-20 05:26:07,392 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (_ BitVec 8)) (v_ArrVal_1669 (_ BitVec 8)) (v_ArrVal_1671 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1666 (_ BitVec 8)) (v_ArrVal_1670 (_ BitVec 8)) (v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse6 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32))) (.cse5 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse4 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (.cse1 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse2 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse3 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (let ((.cse0 (select (store (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse11 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse11) v_ArrVal_1666) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse11 (_ bv1 32)) v_ArrVal_1669) (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse11) v_ArrVal_1668) (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse11) v_ArrVal_1670))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1671))) (store .cse8 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse10 (bvadd (concat (concat (concat (select .cse9 .cse1) (select .cse9 .cse2)) (select .cse9 .cse3)) (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32)))) (store (store (store (store .cse9 .cse7 ((_ extract 7 0) .cse10)) .cse6 ((_ extract 15 8) .cse10)) .cse5 ((_ extract 23 16) .cse10)) .cse4 ((_ extract 31 24) .cse10)))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (concat (concat (concat (select .cse0 .cse4) (select .cse0 .cse5)) (select .cse0 .cse6)) (select .cse0 .cse7)))))) is different from false [2022-07-20 05:26:07,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (_ BitVec 8)) (v_ArrVal_1669 (_ BitVec 8)) (v_ArrVal_1671 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1666 (_ BitVec 8)) (v_ArrVal_1670 (_ BitVec 8)) (v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse6 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32))) (.cse5 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse4 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (.cse1 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse2 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse3 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (let ((.cse0 (select (store (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse11 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse11) v_ArrVal_1666) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse11 (_ bv5 32)) v_ArrVal_1669) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse11) v_ArrVal_1668) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32) .cse11) v_ArrVal_1670))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1671))) (store .cse8 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse10 (bvadd (_ bv1 32) (concat (concat (concat (select .cse9 .cse1) (select .cse9 .cse2)) (select .cse9 .cse3)) (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) (store (store (store (store .cse9 .cse7 ((_ extract 7 0) .cse10)) .cse6 ((_ extract 15 8) .cse10)) .cse5 ((_ extract 23 16) .cse10)) .cse4 ((_ extract 31 24) .cse10)))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (concat (concat (concat (select .cse0 .cse4) (select .cse0 .cse5)) (select .cse0 .cse6)) (select .cse0 .cse7)))))) is different from false [2022-07-20 05:26:07,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (_ BitVec 8)) (v_ArrVal_1669 (_ BitVec 8)) (v_ArrVal_1671 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1666 (_ BitVec 8)) (v_ArrVal_1670 (_ BitVec 8)) (v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1665 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse6 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32))) (.cse5 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse4 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (.cse1 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse2 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse3 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (let ((.cse0 (select (store (let ((.cse8 (store (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1665))) (store .cse11 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse12 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select .cse11 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse12) v_ArrVal_1666) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse12 (_ bv5 32)) v_ArrVal_1669) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse12) v_ArrVal_1668) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32) .cse12) v_ArrVal_1670)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1671))) (store .cse8 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse10 (bvadd (concat (concat (concat (select .cse9 .cse1) (select .cse9 .cse2)) (select .cse9 .cse3)) (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32)))) (store (store (store (store .cse9 .cse7 ((_ extract 7 0) .cse10)) .cse6 ((_ extract 15 8) .cse10)) .cse5 ((_ extract 23 16) .cse10)) .cse4 ((_ extract 31 24) .cse10)))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (concat (concat (concat (select .cse0 .cse4) (select .cse0 .cse5)) (select .cse0 .cse6)) (select .cse0 .cse7)))))) is different from false [2022-07-20 05:26:07,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:07,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:07,680 INFO L356 Elim1Store]: treesize reduction 303, result has 14.6 percent of original size [2022-07-20 05:26:07,681 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 4 case distinctions, treesize of input 19421 treesize of output 7953 [2022-07-20 05:26:07,690 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 2105 treesize of output 2057 [2022-07-20 05:26:07,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 1977 treesize of output 1417 [2022-07-20 05:26:07,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 2425 treesize of output 2305 [2022-07-20 05:26:07,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2305 treesize of output 2165 [2022-07-20 05:26:07,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:07,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:08,104 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:26:08,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 1892 treesize of output 1362 [2022-07-20 05:26:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-07-20 05:26:12,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:26:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512117364] [2022-07-20 05:26:12,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512117364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:26:12,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:26:12,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2022-07-20 05:26:12,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970109337] [2022-07-20 05:26:12,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:26:12,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 05:26:12,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:26:12,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 05:26:12,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=485, Unknown=9, NotChecked=468, Total=1056 [2022-07-20 05:26:12,532 INFO L87 Difference]: Start difference. First operand 1083 states and 1358 transitions. Second operand has 33 states, 33 states have (on average 3.090909090909091) internal successors, (102), 33 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:15,159 INFO L93 Difference]: Finished difference Result 1501 states and 1868 transitions. [2022-07-20 05:26:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:26:15,160 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.090909090909091) internal successors, (102), 33 states have internal predecessors, (102), 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 57 [2022-07-20 05:26:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:15,163 INFO L225 Difference]: With dead ends: 1501 [2022-07-20 05:26:15,163 INFO L226 Difference]: Without dead ends: 1501 [2022-07-20 05:26:15,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 81 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=182, Invalid=901, Unknown=9, NotChecked=630, Total=1722 [2022-07-20 05:26:15,164 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 150 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 894 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:15,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 631 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1016 Invalid, 0 Unknown, 894 Unchecked, 1.6s Time] [2022-07-20 05:26:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2022-07-20 05:26:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1348. [2022-07-20 05:26:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1340 states have (on average 1.273134328358209) internal successors, (1706), 1347 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1706 transitions. [2022-07-20 05:26:15,176 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1706 transitions. Word has length 57 [2022-07-20 05:26:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:15,176 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1706 transitions. [2022-07-20 05:26:15,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.090909090909091) internal successors, (102), 33 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1706 transitions. [2022-07-20 05:26:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 05:26:15,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:15,177 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:15,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2022-07-20 05:26:15,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:26:15,379 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:26:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 784292999, now seen corresponding path program 1 times [2022-07-20 05:26:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:26:15,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977065367] [2022-07-20 05:26:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:26:15,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:26:15,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:26:15,381 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:26:15,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-07-20 05:26:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:26:15,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:26:15,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-20 05:26:15,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:26:16,404 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 27 treesize of output 23 [2022-07-20 05:26:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-20 05:26:17,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:26:17,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977065367] [2022-07-20 05:26:17,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977065367] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:26:17,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:26:17,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2022-07-20 05:26:17,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788769782] [2022-07-20 05:26:17,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:26:17,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:26:17,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:26:17,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:26:17,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:26:17,061 INFO L87 Difference]: Start difference. First operand 1348 states and 1706 transitions. Second operand has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 18 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:40,136 INFO L93 Difference]: Finished difference Result 5736 states and 7426 transitions. [2022-07-20 05:26:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-20 05:26:40,137 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 18 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-20 05:26:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:40,150 INFO L225 Difference]: With dead ends: 5736 [2022-07-20 05:26:40,151 INFO L226 Difference]: Without dead ends: 5736 [2022-07-20 05:26:40,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=480, Invalid=2070, Unknown=0, NotChecked=0, Total=2550 [2022-07-20 05:26:40,152 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 1677 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:40,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 890 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2022-07-20 05:26:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2022-07-20 05:26:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 2033. [2022-07-20 05:26:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 2025 states have (on average 1.2879012345679013) internal successors, (2608), 2032 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2608 transitions. [2022-07-20 05:26:40,181 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2608 transitions. Word has length 58 [2022-07-20 05:26:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:40,181 INFO L495 AbstractCegarLoop]: Abstraction has 2033 states and 2608 transitions. [2022-07-20 05:26:40,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 18 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2608 transitions. [2022-07-20 05:26:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 05:26:40,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:40,182 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:40,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2022-07-20 05:26:40,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:26:40,394 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:26:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 313751902, now seen corresponding path program 1 times [2022-07-20 05:26:40,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:26:40,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708400088] [2022-07-20 05:26:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:26:40,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:26:40,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:26:40,396 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:26:40,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2022-07-20 05:26:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:26:40,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:26:40,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 05:26:47,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:26:47,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:26:47,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708400088] [2022-07-20 05:26:47,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708400088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:26:47,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:26:47,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:26:47,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615256652] [2022-07-20 05:26:47,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:26:47,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:26:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:26:47,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:26:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2022-07-20 05:26:47,412 INFO L87 Difference]: Start difference. First operand 2033 states and 2608 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:47,421 INFO L93 Difference]: Finished difference Result 2032 states and 2607 transitions. [2022-07-20 05:26:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:26:47,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 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 59 [2022-07-20 05:26:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:47,425 INFO L225 Difference]: With dead ends: 2032 [2022-07-20 05:26:47,425 INFO L226 Difference]: Without dead ends: 1986 [2022-07-20 05:26:47,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2022-07-20 05:26:47,426 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:47,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 145 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2022-07-20 05:26:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2022-07-20 05:26:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1213. [2022-07-20 05:26:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1206 states have (on average 1.2719734660033168) internal successors, (1534), 1212 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1534 transitions. [2022-07-20 05:26:47,442 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1534 transitions. Word has length 59 [2022-07-20 05:26:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:47,442 INFO L495 AbstractCegarLoop]: Abstraction has 1213 states and 1534 transitions. [2022-07-20 05:26:47,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1534 transitions. [2022-07-20 05:26:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 05:26:47,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:47,444 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:47,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (51)] Forceful destruction successful, exit code 0 [2022-07-20 05:26:47,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:26:47,656 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:26:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash -28828883, now seen corresponding path program 7 times [2022-07-20 05:26:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:26:47,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6525263] [2022-07-20 05:26:47,657 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:26:47,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:26:47,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:26:47,658 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:26:47,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-07-20 05:26:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:26:47,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 05:26:47,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:48,079 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-20 05:26:48,079 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 11 treesize of output 17 [2022-07-20 05:26:48,640 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 22 treesize of output 16 [2022-07-20 05:26:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 86 proven. 83 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 05:26:48,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:26:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 94 proven. 75 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 05:26:50,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:26:50,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6525263] [2022-07-20 05:26:50,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6525263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:26:50,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:26:50,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-07-20 05:26:50,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391242667] [2022-07-20 05:26:50,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:26:50,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 05:26:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:26:50,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 05:26:50,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:26:50,272 INFO L87 Difference]: Start difference. First operand 1213 states and 1534 transitions. Second operand has 30 states, 30 states have (on average 3.1) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:51,698 INFO L93 Difference]: Finished difference Result 1243 states and 1566 transitions. [2022-07-20 05:26:51,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 05:26:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.1) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-20 05:26:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:51,702 INFO L225 Difference]: With dead ends: 1243 [2022-07-20 05:26:51,702 INFO L226 Difference]: Without dead ends: 1239 [2022-07-20 05:26:51,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 05:26:51,702 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 86 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:51,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 435 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 377 Invalid, 0 Unknown, 55 Unchecked, 1.0s Time] [2022-07-20 05:26:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2022-07-20 05:26:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2022-07-20 05:26:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1232 states have (on average 1.2678571428571428) internal successors, (1562), 1238 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1562 transitions. [2022-07-20 05:26:51,711 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1562 transitions. Word has length 60 [2022-07-20 05:26:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:51,711 INFO L495 AbstractCegarLoop]: Abstraction has 1239 states and 1562 transitions. [2022-07-20 05:26:51,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.1) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1562 transitions. [2022-07-20 05:26:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 05:26:51,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:51,712 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:51,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Ended with exit code 0 [2022-07-20 05:26:51,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:26:51,918 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:26:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2107734792, now seen corresponding path program 2 times [2022-07-20 05:26:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:26:51,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532837639] [2022-07-20 05:26:51,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:26:51,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:26:51,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:26:51,921 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:26:51,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-07-20 05:26:52,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:26:52,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:26:52,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:26:52,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-20 05:26:52,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:26:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-20 05:26:52,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:26:52,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532837639] [2022-07-20 05:26:52,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532837639] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:26:52,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:26:52,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-20 05:26:52,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67570796] [2022-07-20 05:26:52,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:26:52,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:26:52,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:26:52,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:26:52,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:26:52,336 INFO L87 Difference]: Start difference. First operand 1239 states and 1562 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:53,066 INFO L93 Difference]: Finished difference Result 1233 states and 1512 transitions. [2022-07-20 05:26:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:26:53,067 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-20 05:26:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:53,069 INFO L225 Difference]: With dead ends: 1233 [2022-07-20 05:26:53,069 INFO L226 Difference]: Without dead ends: 1233 [2022-07-20 05:26:53,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:26:53,070 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 147 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:53,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 249 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 05:26:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2022-07-20 05:26:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1161. [2022-07-20 05:26:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1154 states have (on average 1.244367417677643) internal successors, (1436), 1160 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1436 transitions. [2022-07-20 05:26:53,081 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1436 transitions. Word has length 60 [2022-07-20 05:26:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:53,082 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1436 transitions. [2022-07-20 05:26:53,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1436 transitions. [2022-07-20 05:26:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-20 05:26:53,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:53,083 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1] [2022-07-20 05:26:53,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Ended with exit code 0 [2022-07-20 05:26:53,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:26:53,284 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:26:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash 58542645, now seen corresponding path program 4 times [2022-07-20 05:26:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:26:53,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129385829] [2022-07-20 05:26:53,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:26:53,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:26:53,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:26:53,285 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:26:53,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2022-07-20 05:26:53,450 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:26:53,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:26:53,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 05:26:53,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:53,467 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 8 treesize of output 7 [2022-07-20 05:26:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:55,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:05,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:27:05,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129385829] [2022-07-20 05:27:05,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129385829] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:05,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:27:05,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2022-07-20 05:27:05,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637914531] [2022-07-20 05:27:05,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:05,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-20 05:27:05,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:27:05,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-20 05:27:05,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=1525, Unknown=0, NotChecked=0, Total=2070 [2022-07-20 05:27:05,053 INFO L87 Difference]: Start difference. First operand 1161 states and 1436 transitions. Second operand has 46 states, 45 states have (on average 2.888888888888889) internal successors, (130), 46 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:20,168 WARN L233 SmtUtils]: Spent 9.44s on a formula simplification that was a NOOP. DAG size: 171 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:27:23,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 05:27:25,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 05:27:27,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 05:27:37,343 WARN L233 SmtUtils]: Spent 9.52s on a formula simplification that was a NOOP. DAG size: 168 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)