./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.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 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:10:50,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:10:50,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:10:50,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:10:50,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:10:50,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:10:50,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:10:50,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:10:50,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:10:50,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:10:50,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:10:50,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:10:50,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:10:50,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:10:50,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:10:50,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:10:50,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:10:50,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:10:50,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:10:50,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:10:50,186 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:10:50,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:10:50,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:10:50,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:10:50,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:10:50,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:10:50,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:10:50,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:10:50,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:10:50,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:10:50,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:10:50,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:10:50,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:10:50,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:10:50,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:10:50,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:10:50,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:10:50,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:10:50,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:10:50,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:10:50,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:10:50,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:10:50,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-13 01:10:50,225 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:10:50,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:10:50,226 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:10:50,226 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:10:50,227 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:10:50,227 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:10:50,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:10:50,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:10:50,228 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:10:50,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:10:50,229 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:10:50,229 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:10:50,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:10:50,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:10:50,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:10:50,229 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:10:50,229 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:10:50,230 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:10:50,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:10:50,231 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:10:50,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:10:50,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:10:50,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:10:50,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:10:50,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:10:50,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:10:50,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:10:50,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:10:50,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:10:50,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:10:50,232 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 -> 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 [2022-07-13 01:10:50,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:10:50,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:10:50,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:10:50,468 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:10:50,468 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:10:50,469 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-07-13 01:10:50,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ec749bf/71698b3551ac40b1901cf8ebf55c1a44/FLAGb4138b641 [2022-07-13 01:10:51,054 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:10:51,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-07-13 01:10:51,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ec749bf/71698b3551ac40b1901cf8ebf55c1a44/FLAGb4138b641 [2022-07-13 01:10:51,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ec749bf/71698b3551ac40b1901cf8ebf55c1a44 [2022-07-13 01:10:51,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:10:51,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:10:51,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:10:51,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:10:51,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:10:51,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:10:51" (1/1) ... [2022-07-13 01:10:51,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682312ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:51, skipping insertion in model container [2022-07-13 01:10:51,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:10:51" (1/1) ... [2022-07-13 01:10:51,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:10:51,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:10:51,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i[33022,33035] [2022-07-13 01:10:52,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:10:52,129 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-13 01:10:52,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@411f9b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:52, skipping insertion in model container [2022-07-13 01:10:52,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:10:52,131 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-13 01:10:52,132 INFO L158 Benchmark]: Toolchain (without parser) took 628.64ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 120.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 01:10:52,133 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory was 41.5MB in the beginning and 41.5MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:10:52,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.57ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 120.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 01:10:52,136 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.13ms. Allocated memory is still 83.9MB. Free memory was 41.5MB in the beginning and 41.5MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 622.57ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 120.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.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 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:10:53,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:10:53,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:10:53,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:10:54,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:10:54,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:10:54,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:10:54,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:10:54,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:10:54,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:10:54,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:10:54,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:10:54,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:10:54,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:10:54,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:10:54,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:10:54,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:10:54,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:10:54,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:10:54,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:10:54,034 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:10:54,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:10:54,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:10:54,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:10:54,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:10:54,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:10:54,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:10:54,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:10:54,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:10:54,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:10:54,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:10:54,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:10:54,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:10:54,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:10:54,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:10:54,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:10:54,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:10:54,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:10:54,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:10:54,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:10:54,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:10:54,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:10:54,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-13 01:10:54,084 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:10:54,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:10:54,085 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:10:54,085 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:10:54,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:10:54,086 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:10:54,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:10:54,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:10:54,087 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:10:54,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:10:54,088 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:10:54,088 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:10:54,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:10:54,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:10:54,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:10:54,089 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:10:54,089 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:10:54,089 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:10:54,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:10:54,090 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:10:54,090 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 01:10:54,090 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 01:10:54,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:10:54,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:10:54,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:10:54,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:10:54,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:10:54,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:10:54,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:10:54,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:10:54,092 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 01:10:54,092 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 01:10:54,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 01:10:54,092 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 -> 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 [2022-07-13 01:10:54,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:10:54,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:10:54,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:10:54,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:10:54,416 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:10:54,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-07-13 01:10:54,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e3f71b9/a96dc3651d2345adb81c4de434df91be/FLAGc17b1c0aa [2022-07-13 01:10:55,053 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:10:55,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2022-07-13 01:10:55,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e3f71b9/a96dc3651d2345adb81c4de434df91be/FLAGc17b1c0aa [2022-07-13 01:10:55,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e3f71b9/a96dc3651d2345adb81c4de434df91be [2022-07-13 01:10:55,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:10:55,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:10:55,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:10:55,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:10:55,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:10:55,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:10:55" (1/1) ... [2022-07-13 01:10:55,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7531b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:55, skipping insertion in model container [2022-07-13 01:10:55,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:10:55" (1/1) ... [2022-07-13 01:10:55,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:10:55,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:10:56,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i[33022,33035] [2022-07-13 01:10:56,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:10:56,165 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 01:10:56,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:10:56,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i[33022,33035] [2022-07-13 01:10:56,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:10:56,278 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:10:56,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i[33022,33035] [2022-07-13 01:10:56,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:10:56,373 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:10:56,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56 WrapperNode [2022-07-13 01:10:56,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:10:56,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:10:56,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:10:56,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:10:56,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (1/1) ... [2022-07-13 01:10:56,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (1/1) ... [2022-07-13 01:10:56,509 INFO L137 Inliner]: procedures = 180, calls = 623, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2491 [2022-07-13 01:10:56,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:10:56,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:10:56,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:10:56,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:10:56,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (1/1) ... [2022-07-13 01:10:56,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (1/1) ... [2022-07-13 01:10:56,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (1/1) ... [2022-07-13 01:10:56,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (1/1) ... [2022-07-13 01:10:56,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (1/1) ... [2022-07-13 01:10:56,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (1/1) ... [2022-07-13 01:10:56,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (1/1) ... [2022-07-13 01:10:56,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:10:56,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:10:56,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:10:56,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:10:56,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (1/1) ... [2022-07-13 01:10:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:10:56,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:10:56,703 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-13 01:10:56,721 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-13 01:10:56,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 01:10:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-07-13 01:10:56,731 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-07-13 01:10:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 01:10:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 01:10:56,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 01:10:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 01:10:56,731 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 01:10:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 01:10:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 01:10:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 01:10:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 01:10:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 01:10:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 01:10:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 01:10:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 01:10:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 01:10:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:10:56,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:10:56,977 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:10:56,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:10:56,981 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 01:11:03,544 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:11:03,577 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:11:03,577 INFO L299 CfgBuilder]: Removed 168 assume(true) statements. [2022-07-13 01:11:03,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:11:03 BoogieIcfgContainer [2022-07-13 01:11:03,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:11:03,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:11:03,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:11:03,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:11:03,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:10:55" (1/3) ... [2022-07-13 01:11:03,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd6b0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:11:03, skipping insertion in model container [2022-07-13 01:11:03,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:10:56" (2/3) ... [2022-07-13 01:11:03,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd6b0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:11:03, skipping insertion in model container [2022-07-13 01:11:03,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:11:03" (3/3) ... [2022-07-13 01:11:03,592 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-3.i [2022-07-13 01:11:03,606 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:11:03,607 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1193 error locations. [2022-07-13 01:11:03,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:11:03,753 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@2e82d5f7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7151a5e0 [2022-07-13 01:11:03,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1193 error locations. [2022-07-13 01:11:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 2437 states, 1232 states have (on average 2.2280844155844157) internal successors, (2745), 2423 states have internal predecessors, (2745), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-13 01:11:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:11:03,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:03,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:11:03,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-07-13 01:11:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:03,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895170793] [2022-07-13 01:11:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:03,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:03,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:03,820 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-13 01:11:03,854 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-13 01:11:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:03,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:11:04,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:04,038 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-13 01:11:04,052 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-13 01:11:04,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:04,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:04,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895170793] [2022-07-13 01:11:04,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895170793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:04,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:04,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:11:04,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141968695] [2022-07-13 01:11:04,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:04,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:11:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:04,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:11:04,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:11:04,077 INFO L87 Difference]: Start difference. First operand has 2437 states, 1232 states have (on average 2.2280844155844157) internal successors, (2745), 2423 states have internal predecessors, (2745), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:07,193 INFO L93 Difference]: Finished difference Result 3281 states and 3483 transitions. [2022-07-13 01:11:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:11:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 01:11:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:07,225 INFO L225 Difference]: With dead ends: 3281 [2022-07-13 01:11:07,225 INFO L226 Difference]: Without dead ends: 3279 [2022-07-13 01:11:07,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:11:07,231 INFO L413 NwaCegarLoop]: 1665 mSDtfsCounter, 2318 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2328 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:07,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2328 Valid, 2230 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-13 01:11:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-07-13 01:11:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2579. [2022-07-13 01:11:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 1398 states have (on average 2.067238912732475) internal successors, (2890), 2563 states have internal predecessors, (2890), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-13 01:11:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 2922 transitions. [2022-07-13 01:11:07,346 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 2922 transitions. Word has length 3 [2022-07-13 01:11:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:07,347 INFO L495 AbstractCegarLoop]: Abstraction has 2579 states and 2922 transitions. [2022-07-13 01:11:07,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 2922 transitions. [2022-07-13 01:11:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:11:07,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:07,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:11:07,366 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-13 01:11:07,567 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-13 01:11:07,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:07,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-07-13 01:11:07,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:07,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543710536] [2022-07-13 01:11:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:07,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:07,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:07,578 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-13 01:11:07,579 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-13 01:11:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:07,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:11:07,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:07,759 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-13 01:11:07,767 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-13 01:11:07,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:07,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:07,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543710536] [2022-07-13 01:11:07,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543710536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:07,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:07,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:11:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521119845] [2022-07-13 01:11:07,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:07,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:11:07,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:07,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:11:07,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:11:07,771 INFO L87 Difference]: Start difference. First operand 2579 states and 2922 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:12,621 INFO L93 Difference]: Finished difference Result 3727 states and 4170 transitions. [2022-07-13 01:11:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:11:12,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 01:11:12,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:12,631 INFO L225 Difference]: With dead ends: 3727 [2022-07-13 01:11:12,631 INFO L226 Difference]: Without dead ends: 3727 [2022-07-13 01:11:12,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:11:12,632 INFO L413 NwaCegarLoop]: 2045 mSDtfsCounter, 1240 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:12,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 3433 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-13 01:11:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2022-07-13 01:11:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3028. [2022-07-13 01:11:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 1845 states have (on average 2.0233062330623306) internal successors, (3733), 3009 states have internal predecessors, (3733), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 01:11:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 3771 transitions. [2022-07-13 01:11:12,676 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 3771 transitions. Word has length 3 [2022-07-13 01:11:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:12,676 INFO L495 AbstractCegarLoop]: Abstraction has 3028 states and 3771 transitions. [2022-07-13 01:11:12,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 3771 transitions. [2022-07-13 01:11:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 01:11:12,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:12,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:12,686 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-13 01:11:12,886 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-13 01:11:12,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-07-13 01:11:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:12,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285565310] [2022-07-13 01:11:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:12,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:12,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:12,889 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-13 01:11:12,892 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-13 01:11:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:13,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:11:13,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:13,063 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-13 01:11:13,070 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-13 01:11:13,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:11:13,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 01:11:13,121 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:11:13,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-13 01:11:13,137 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-13 01:11:13,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:13,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:13,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285565310] [2022-07-13 01:11:13,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285565310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:13,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:13,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:11:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196690862] [2022-07-13 01:11:13,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:13,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:11:13,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:11:13,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:11:13,140 INFO L87 Difference]: Start difference. First operand 3028 states and 3771 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-13 01:11:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:21,298 INFO L93 Difference]: Finished difference Result 6006 states and 6937 transitions. [2022-07-13 01:11:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:11:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-13 01:11:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:21,313 INFO L225 Difference]: With dead ends: 6006 [2022-07-13 01:11:21,313 INFO L226 Difference]: Without dead ends: 6006 [2022-07-13 01:11:21,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-13 01:11:21,314 INFO L413 NwaCegarLoop]: 981 mSDtfsCounter, 3127 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3137 SdHoareTripleChecker+Valid, 3162 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:21,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3137 Valid, 3162 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-07-13 01:11:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2022-07-13 01:11:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3747. [2022-07-13 01:11:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3747 states, 2564 states have (on average 2.0514820592823715) internal successors, (5260), 3722 states have internal predecessors, (5260), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3747 states to 3747 states and 5310 transitions. [2022-07-13 01:11:21,394 INFO L78 Accepts]: Start accepts. Automaton has 3747 states and 5310 transitions. Word has length 7 [2022-07-13 01:11:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:21,395 INFO L495 AbstractCegarLoop]: Abstraction has 3747 states and 5310 transitions. [2022-07-13 01:11:21,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-13 01:11:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3747 states and 5310 transitions. [2022-07-13 01:11:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 01:11:21,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:21,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:21,407 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-13 01:11:21,605 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-13 01:11:21,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-07-13 01:11:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:21,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195040565] [2022-07-13 01:11:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:21,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:21,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:21,608 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-13 01:11:21,610 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-13 01:11:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:21,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:11:21,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:21,773 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-13 01:11:21,778 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-13 01:11:21,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:21,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:21,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195040565] [2022-07-13 01:11:21,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195040565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:21,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:21,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:11:21,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503507205] [2022-07-13 01:11:21,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:21,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:11:21,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:11:21,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:11:21,781 INFO L87 Difference]: Start difference. First operand 3747 states and 5310 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-13 01:11:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:24,479 INFO L93 Difference]: Finished difference Result 4951 states and 6827 transitions. [2022-07-13 01:11:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:11:24,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-13 01:11:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:24,491 INFO L225 Difference]: With dead ends: 4951 [2022-07-13 01:11:24,491 INFO L226 Difference]: Without dead ends: 4951 [2022-07-13 01:11:24,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 01:11:24,493 INFO L413 NwaCegarLoop]: 2366 mSDtfsCounter, 1998 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:24,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 3212 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-13 01:11:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2022-07-13 01:11:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 3656. [2022-07-13 01:11:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 2564 states have (on average 1.968408736349454) internal successors, (5047), 3631 states have internal predecessors, (5047), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5097 transitions. [2022-07-13 01:11:24,565 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 5097 transitions. Word has length 8 [2022-07-13 01:11:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:24,569 INFO L495 AbstractCegarLoop]: Abstraction has 3656 states and 5097 transitions. [2022-07-13 01:11:24,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-13 01:11:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 5097 transitions. [2022-07-13 01:11:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 01:11:24,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:24,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:24,579 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-13 01:11:24,777 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-13 01:11:24,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-07-13 01:11:24,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:24,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289380411] [2022-07-13 01:11:24,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:24,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:24,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:24,780 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-13 01:11:24,799 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-13 01:11:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:24,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:11:24,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:24,974 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-13 01:11:25,005 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-13 01:11:25,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:25,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:25,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289380411] [2022-07-13 01:11:25,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289380411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:25,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:25,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:11:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337775557] [2022-07-13 01:11:25,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:25,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:11:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:11:25,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:11:25,008 INFO L87 Difference]: Start difference. First operand 3656 states and 5097 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-13 01:11:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:29,085 INFO L93 Difference]: Finished difference Result 5371 states and 7455 transitions. [2022-07-13 01:11:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:11:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-13 01:11:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:29,099 INFO L225 Difference]: With dead ends: 5371 [2022-07-13 01:11:29,099 INFO L226 Difference]: Without dead ends: 5371 [2022-07-13 01:11:29,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 01:11:29,100 INFO L413 NwaCegarLoop]: 2746 mSDtfsCounter, 1369 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3931 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:29,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3931 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-13 01:11:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2022-07-13 01:11:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 3978. [2022-07-13 01:11:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 2896 states have (on average 1.9540745856353592) internal successors, (5659), 3953 states have internal predecessors, (5659), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5709 transitions. [2022-07-13 01:11:29,188 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5709 transitions. Word has length 8 [2022-07-13 01:11:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:29,189 INFO L495 AbstractCegarLoop]: Abstraction has 3978 states and 5709 transitions. [2022-07-13 01:11:29,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-13 01:11:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5709 transitions. [2022-07-13 01:11:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 01:11:29,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:29,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:29,212 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-13 01:11:29,396 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-13 01:11:29,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:29,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:29,397 INFO L85 PathProgramCache]: Analyzing trace with hash -690352907, now seen corresponding path program 1 times [2022-07-13 01:11:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:29,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965053001] [2022-07-13 01:11:29,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:29,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:29,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:29,400 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-13 01:11:29,413 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-13 01:11:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:29,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:11:29,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:29,585 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-13 01:11:29,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:29,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:29,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965053001] [2022-07-13 01:11:29,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965053001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:29,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:29,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:11:29,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105328761] [2022-07-13 01:11:29,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:29,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:11:29,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:11:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:11:29,587 INFO L87 Difference]: Start difference. First operand 3978 states and 5709 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:29,616 INFO L93 Difference]: Finished difference Result 3918 states and 5623 transitions. [2022-07-13 01:11:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:11:29,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 01:11:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:29,626 INFO L225 Difference]: With dead ends: 3918 [2022-07-13 01:11:29,626 INFO L226 Difference]: Without dead ends: 3918 [2022-07-13 01:11:29,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:11:29,627 INFO L413 NwaCegarLoop]: 2407 mSDtfsCounter, 1197 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 3623 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:29,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 3623 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:11:29,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3918 states. [2022-07-13 01:11:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3918 to 3918. [2022-07-13 01:11:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 2860 states have (on average 1.9486013986013986) internal successors, (5573), 3893 states have internal predecessors, (5573), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5623 transitions. [2022-07-13 01:11:29,678 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5623 transitions. Word has length 11 [2022-07-13 01:11:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:29,679 INFO L495 AbstractCegarLoop]: Abstraction has 3918 states and 5623 transitions. [2022-07-13 01:11:29,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5623 transitions. [2022-07-13 01:11:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 01:11:29,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:29,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:29,686 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-13 01:11:29,886 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-13 01:11:29,887 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2004126129, now seen corresponding path program 1 times [2022-07-13 01:11:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:29,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415105166] [2022-07-13 01:11:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:29,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:29,890 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-13 01:11:29,891 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-13 01:11:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:30,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:11:30,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:30,102 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-13 01:11:30,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:30,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:30,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415105166] [2022-07-13 01:11:30,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415105166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:30,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:30,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:11:30,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135915320] [2022-07-13 01:11:30,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:30,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:11:30,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:11:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:11:30,105 INFO L87 Difference]: Start difference. First operand 3918 states and 5623 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:30,174 INFO L93 Difference]: Finished difference Result 3890 states and 5567 transitions. [2022-07-13 01:11:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:11:30,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 01:11:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:30,188 INFO L225 Difference]: With dead ends: 3890 [2022-07-13 01:11:30,189 INFO L226 Difference]: Without dead ends: 3890 [2022-07-13 01:11:30,189 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-13 01:11:30,190 INFO L413 NwaCegarLoop]: 2362 mSDtfsCounter, 1168 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 5933 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:30,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 5933 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:11:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2022-07-13 01:11:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3888. [2022-07-13 01:11:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3888 states, 2844 states have (on average 1.939170182841069) internal successors, (5515), 3863 states have internal predecessors, (5515), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 5565 transitions. [2022-07-13 01:11:30,254 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 5565 transitions. Word has length 13 [2022-07-13 01:11:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:30,254 INFO L495 AbstractCegarLoop]: Abstraction has 3888 states and 5565 transitions. [2022-07-13 01:11:30,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 5565 transitions. [2022-07-13 01:11:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 01:11:30,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:30,256 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-13 01:11:30,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-13 01:11:30,463 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-13 01:11:30,463 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-07-13 01:11:30,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:30,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518022514] [2022-07-13 01:11:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:30,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:30,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:30,466 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-13 01:11:30,467 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-13 01:11:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:30,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:11:30,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:30,653 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-13 01:11:30,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:30,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:30,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518022514] [2022-07-13 01:11:30,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518022514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:30,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:30,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:11:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121804481] [2022-07-13 01:11:30,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:30,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:11:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:30,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:11:30,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:11:30,654 INFO L87 Difference]: Start difference. First operand 3888 states and 5565 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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-13 01:11:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:30,687 INFO L93 Difference]: Finished difference Result 5514 states and 7318 transitions. [2022-07-13 01:11:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:11:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) 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 20 [2022-07-13 01:11:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:30,694 INFO L225 Difference]: With dead ends: 5514 [2022-07-13 01:11:30,694 INFO L226 Difference]: Without dead ends: 5514 [2022-07-13 01:11:30,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-13 01:11:30,694 INFO L413 NwaCegarLoop]: 4091 mSDtfsCounter, 2288 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 5893 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:30,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 5893 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:11:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5514 states. [2022-07-13 01:11:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5514 to 3828. [2022-07-13 01:11:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3828 states, 2808 states have (on average 1.9334045584045585) internal successors, (5429), 3803 states have internal predecessors, (5429), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 5479 transitions. [2022-07-13 01:11:30,730 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 5479 transitions. Word has length 20 [2022-07-13 01:11:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:30,753 INFO L495 AbstractCegarLoop]: Abstraction has 3828 states and 5479 transitions. [2022-07-13 01:11:30,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) 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-13 01:11:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 5479 transitions. [2022-07-13 01:11:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 01:11:30,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:30,754 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-13 01:11:30,776 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-13 01:11:30,961 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-13 01:11:30,961 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:30,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:30,963 INFO L85 PathProgramCache]: Analyzing trace with hash 591123743, now seen corresponding path program 1 times [2022-07-13 01:11:30,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:30,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457934813] [2022-07-13 01:11:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:30,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:30,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:30,964 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-13 01:11:30,965 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-13 01:11:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:31,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:11:31,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:31,157 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-13 01:11:31,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:31,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:31,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457934813] [2022-07-13 01:11:31,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457934813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:31,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:31,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:11:31,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544480463] [2022-07-13 01:11:31,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:31,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:11:31,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:31,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:11:31,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:11:31,159 INFO L87 Difference]: Start difference. First operand 3828 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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-13 01:11:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:31,191 INFO L93 Difference]: Finished difference Result 5347 states and 7027 transitions. [2022-07-13 01:11:31,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:11:31,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) 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 20 [2022-07-13 01:11:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:31,198 INFO L225 Difference]: With dead ends: 5347 [2022-07-13 01:11:31,198 INFO L226 Difference]: Without dead ends: 5347 [2022-07-13 01:11:31,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-13 01:11:31,199 INFO L413 NwaCegarLoop]: 3778 mSDtfsCounter, 2245 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 5532 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:31,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2255 Valid, 5532 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:11:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2022-07-13 01:11:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 3696. [2022-07-13 01:11:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2700 states have (on average 1.915185185185185) internal successors, (5171), 3671 states have internal predecessors, (5171), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5221 transitions. [2022-07-13 01:11:31,234 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 5221 transitions. Word has length 20 [2022-07-13 01:11:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:31,234 INFO L495 AbstractCegarLoop]: Abstraction has 3696 states and 5221 transitions. [2022-07-13 01:11:31,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) 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-13 01:11:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 5221 transitions. [2022-07-13 01:11:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 01:11:31,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:31,235 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] [2022-07-13 01:11:31,245 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-13 01:11:31,443 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-13 01:11:31,443 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-07-13 01:11:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:31,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818367253] [2022-07-13 01:11:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:31,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:31,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:31,446 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-13 01:11:31,449 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-13 01:11:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:31,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:11:31,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:31,654 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-13 01:11:31,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:31,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:31,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818367253] [2022-07-13 01:11:31,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818367253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:31,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:31,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:11:31,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906896307] [2022-07-13 01:11:31,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:31,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:11:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:31,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:11:31,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:11:31,655 INFO L87 Difference]: Start difference. First operand 3696 states and 5221 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-13 01:11:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:31,729 INFO L93 Difference]: Finished difference Result 5312 states and 6961 transitions. [2022-07-13 01:11:31,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:11:31,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-13 01:11:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:31,762 INFO L225 Difference]: With dead ends: 5312 [2022-07-13 01:11:31,762 INFO L226 Difference]: Without dead ends: 5312 [2022-07-13 01:11:31,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-13 01:11:31,763 INFO L413 NwaCegarLoop]: 3960 mSDtfsCounter, 2216 mSDsluCounter, 5712 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 9672 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:31,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2226 Valid, 9672 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:11:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2022-07-13 01:11:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 3666. [2022-07-13 01:11:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 2684 states have (on average 1.9049925484351713) internal successors, (5113), 3641 states have internal predecessors, (5113), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 5163 transitions. [2022-07-13 01:11:31,796 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 5163 transitions. Word has length 22 [2022-07-13 01:11:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:31,796 INFO L495 AbstractCegarLoop]: Abstraction has 3666 states and 5163 transitions. [2022-07-13 01:11:31,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-13 01:11:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 5163 transitions. [2022-07-13 01:11:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 01:11:31,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:31,797 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] [2022-07-13 01:11:31,812 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-13 01:11:32,005 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-13 01:11:32,005 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr359REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:32,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1134259450, now seen corresponding path program 1 times [2022-07-13 01:11:32,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:32,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927408229] [2022-07-13 01:11:32,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:32,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:32,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:32,007 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-13 01:11:32,008 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-13 01:11:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:32,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:11:32,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:32,214 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-13 01:11:32,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:32,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:32,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927408229] [2022-07-13 01:11:32,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927408229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:32,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:32,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:11:32,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168261631] [2022-07-13 01:11:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:32,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:11:32,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:32,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:11:32,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:11:32,215 INFO L87 Difference]: Start difference. First operand 3666 states and 5163 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-13 01:11:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:32,295 INFO L93 Difference]: Finished difference Result 5239 states and 6772 transitions. [2022-07-13 01:11:32,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:11:32,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-13 01:11:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:32,303 INFO L225 Difference]: With dead ends: 5239 [2022-07-13 01:11:32,303 INFO L226 Difference]: Without dead ends: 5239 [2022-07-13 01:11:32,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-13 01:11:32,304 INFO L413 NwaCegarLoop]: 3885 mSDtfsCounter, 2181 mSDsluCounter, 5597 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 9482 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:32,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 9482 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:11:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5239 states. [2022-07-13 01:11:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5239 to 3604. [2022-07-13 01:11:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 2636 states have (on average 1.8736722306525038) internal successors, (4939), 3579 states have internal predecessors, (4939), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4989 transitions. [2022-07-13 01:11:32,347 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4989 transitions. Word has length 22 [2022-07-13 01:11:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:32,349 INFO L495 AbstractCegarLoop]: Abstraction has 3604 states and 4989 transitions. [2022-07-13 01:11:32,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-13 01:11:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4989 transitions. [2022-07-13 01:11:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:11:32,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:32,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:32,379 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-13 01:11:32,558 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-13 01:11:32,558 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:32,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:32,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519613, now seen corresponding path program 1 times [2022-07-13 01:11:32,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:32,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487564751] [2022-07-13 01:11:32,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:32,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:32,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:32,560 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-13 01:11:32,562 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-13 01:11:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:32,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:11:32,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:32,762 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-13 01:11:32,809 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-13 01:11:32,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:32,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:32,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487564751] [2022-07-13 01:11:32,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487564751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:32,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:32,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:11:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94640121] [2022-07-13 01:11:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:32,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:11:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:32,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:11:32,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:11:32,810 INFO L87 Difference]: Start difference. First operand 3604 states and 4989 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:35,705 INFO L93 Difference]: Finished difference Result 4225 states and 5525 transitions. [2022-07-13 01:11:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:11:35,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 01:11:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:35,710 INFO L225 Difference]: With dead ends: 4225 [2022-07-13 01:11:35,711 INFO L226 Difference]: Without dead ends: 4225 [2022-07-13 01:11:35,711 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-13 01:11:35,711 INFO L413 NwaCegarLoop]: 1515 mSDtfsCounter, 3097 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3103 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:35,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3103 Valid, 2793 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-13 01:11:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2022-07-13 01:11:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 3600. [2022-07-13 01:11:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 2636 states have (on average 1.8706373292867982) internal successors, (4931), 3575 states have internal predecessors, (4931), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4981 transitions. [2022-07-13 01:11:35,739 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4981 transitions. Word has length 27 [2022-07-13 01:11:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:35,739 INFO L495 AbstractCegarLoop]: Abstraction has 3600 states and 4981 transitions. [2022-07-13 01:11:35,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4981 transitions. [2022-07-13 01:11:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:11:35,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:35,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:35,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-13 01:11:35,947 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-13 01:11:35,947 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519614, now seen corresponding path program 1 times [2022-07-13 01:11:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:35,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930831098] [2022-07-13 01:11:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:35,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:35,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:35,967 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-13 01:11:35,968 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-13 01:11:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:36,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:11:36,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:36,169 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-13 01:11:36,292 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-13 01:11:36,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:36,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:36,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930831098] [2022-07-13 01:11:36,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930831098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:36,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:36,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:11:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642073490] [2022-07-13 01:11:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:36,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:11:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:11:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:11:36,295 INFO L87 Difference]: Start difference. First operand 3600 states and 4981 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:41,240 INFO L93 Difference]: Finished difference Result 4679 states and 6151 transitions. [2022-07-13 01:11:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:11:41,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 01:11:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:41,247 INFO L225 Difference]: With dead ends: 4679 [2022-07-13 01:11:41,248 INFO L226 Difference]: Without dead ends: 4679 [2022-07-13 01:11:41,248 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-13 01:11:41,248 INFO L413 NwaCegarLoop]: 1748 mSDtfsCounter, 2279 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2279 SdHoareTripleChecker+Valid, 4099 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:41,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2279 Valid, 4099 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-13 01:11:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2022-07-13 01:11:41,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 3636. [2022-07-13 01:11:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 2672 states have (on average 1.8607784431137724) internal successors, (4972), 3611 states have internal predecessors, (4972), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5022 transitions. [2022-07-13 01:11:41,287 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5022 transitions. Word has length 27 [2022-07-13 01:11:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:41,288 INFO L495 AbstractCegarLoop]: Abstraction has 3636 states and 5022 transitions. [2022-07-13 01:11:41,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:11:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5022 transitions. [2022-07-13 01:11:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:11:41,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:41,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:41,311 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-13 01:11:41,496 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-13 01:11:41,496 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:41,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-07-13 01:11:41,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:41,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319852246] [2022-07-13 01:11:41,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:41,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:41,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:41,499 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-13 01:11:41,500 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-13 01:11:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:41,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:11:41,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:41,693 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-13 01:11:41,735 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-13 01:11:41,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:41,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:41,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319852246] [2022-07-13 01:11:41,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319852246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:41,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:41,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:11:41,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325729124] [2022-07-13 01:11:41,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:41,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:11:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:11:41,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:11:41,738 INFO L87 Difference]: Start difference. First operand 3636 states and 5022 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-13 01:11:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:45,710 INFO L93 Difference]: Finished difference Result 7033 states and 9556 transitions. [2022-07-13 01:11:45,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:11:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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 36 [2022-07-13 01:11:45,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:45,721 INFO L225 Difference]: With dead ends: 7033 [2022-07-13 01:11:45,721 INFO L226 Difference]: Without dead ends: 7033 [2022-07-13 01:11:45,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-13 01:11:45,722 INFO L413 NwaCegarLoop]: 2580 mSDtfsCounter, 4500 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 3122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:45,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 4978 Invalid, 3122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-13 01:11:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2022-07-13 01:11:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 3632. [2022-07-13 01:11:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3632 states, 2672 states have (on average 1.8577844311377245) internal successors, (4964), 3607 states have internal predecessors, (4964), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5014 transitions. [2022-07-13 01:11:45,779 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 5014 transitions. Word has length 36 [2022-07-13 01:11:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:45,780 INFO L495 AbstractCegarLoop]: Abstraction has 3632 states and 5014 transitions. [2022-07-13 01:11:45,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-13 01:11:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5014 transitions. [2022-07-13 01:11:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:11:45,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:45,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:45,792 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-13 01:11:45,990 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-13 01:11:45,990 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:45,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-07-13 01:11:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:45,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362960626] [2022-07-13 01:11:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:45,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:45,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:45,994 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-13 01:11:46,013 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-13 01:11:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:46,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:11:46,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:46,222 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-13 01:11:46,329 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-13 01:11:46,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:46,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:46,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362960626] [2022-07-13 01:11:46,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362960626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:46,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:46,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:11:46,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487035606] [2022-07-13 01:11:46,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:46,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:11:46,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:46,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:11:46,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:11:46,332 INFO L87 Difference]: Start difference. First operand 3632 states and 5014 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-13 01:11:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:52,312 INFO L93 Difference]: Finished difference Result 6725 states and 8957 transitions. [2022-07-13 01:11:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:11:52,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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 36 [2022-07-13 01:11:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:52,320 INFO L225 Difference]: With dead ends: 6725 [2022-07-13 01:11:52,320 INFO L226 Difference]: Without dead ends: 6725 [2022-07-13 01:11:52,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-13 01:11:52,321 INFO L413 NwaCegarLoop]: 2937 mSDtfsCounter, 3252 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3256 SdHoareTripleChecker+Valid, 5833 SdHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:52,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3256 Valid, 5833 Invalid, 3332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-13 01:11:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2022-07-13 01:11:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 3628. [2022-07-13 01:11:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 2672 states have (on average 1.8547904191616766) internal successors, (4956), 3603 states have internal predecessors, (4956), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 5006 transitions. [2022-07-13 01:11:52,359 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 5006 transitions. Word has length 36 [2022-07-13 01:11:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:52,360 INFO L495 AbstractCegarLoop]: Abstraction has 3628 states and 5006 transitions. [2022-07-13 01:11:52,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-13 01:11:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 5006 transitions. [2022-07-13 01:11:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:11:52,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:52,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:52,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-13 01:11:52,568 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-13 01:11:52,569 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:52,569 INFO L85 PathProgramCache]: Analyzing trace with hash -526454297, now seen corresponding path program 1 times [2022-07-13 01:11:52,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:52,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226337412] [2022-07-13 01:11:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:52,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:52,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:52,585 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-13 01:11:52,586 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-13 01:11:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:52,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:11:52,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:52,801 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-13 01:11:52,850 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-13 01:11:52,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:52,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:52,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226337412] [2022-07-13 01:11:52,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226337412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:52,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:52,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:11:52,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244845159] [2022-07-13 01:11:52,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:52,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:11:52,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:52,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:11:52,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:11:52,859 INFO L87 Difference]: Start difference. First operand 3628 states and 5006 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-13 01:11:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:11:57,798 INFO L93 Difference]: Finished difference Result 7477 states and 10068 transitions. [2022-07-13 01:11:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:11:57,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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 36 [2022-07-13 01:11:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:11:57,806 INFO L225 Difference]: With dead ends: 7477 [2022-07-13 01:11:57,806 INFO L226 Difference]: Without dead ends: 7477 [2022-07-13 01:11:57,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-13 01:11:57,806 INFO L413 NwaCegarLoop]: 2542 mSDtfsCounter, 4861 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4871 SdHoareTripleChecker+Valid, 5133 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-13 01:11:57,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4871 Valid, 5133 Invalid, 3393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-13 01:11:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-07-13 01:11:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 3625. [2022-07-13 01:11:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2672 states have (on average 1.846556886227545) internal successors, (4934), 3600 states have internal predecessors, (4934), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:11:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 4984 transitions. [2022-07-13 01:11:57,856 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 4984 transitions. Word has length 36 [2022-07-13 01:11:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:11:57,856 INFO L495 AbstractCegarLoop]: Abstraction has 3625 states and 4984 transitions. [2022-07-13 01:11:57,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-13 01:11:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 4984 transitions. [2022-07-13 01:11:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:11:57,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:11:57,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:11:57,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-13 01:11:58,064 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-13 01:11:58,064 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:11:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:11:58,065 INFO L85 PathProgramCache]: Analyzing trace with hash -526454296, now seen corresponding path program 1 times [2022-07-13 01:11:58,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:11:58,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898959224] [2022-07-13 01:11:58,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:11:58,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:11:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:11:58,066 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-13 01:11:58,069 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-13 01:11:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:11:58,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:11:58,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:11:58,285 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-13 01:11:58,387 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-13 01:11:58,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:11:58,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:11:58,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898959224] [2022-07-13 01:11:58,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898959224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:11:58,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:11:58,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:11:58,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849227960] [2022-07-13 01:11:58,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:11:58,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:11:58,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:11:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:11:58,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:11:58,389 INFO L87 Difference]: Start difference. First operand 3625 states and 4984 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-13 01:12:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:03,505 INFO L93 Difference]: Finished difference Result 5561 states and 7343 transitions. [2022-07-13 01:12:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:12:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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 36 [2022-07-13 01:12:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:03,511 INFO L225 Difference]: With dead ends: 5561 [2022-07-13 01:12:03,511 INFO L226 Difference]: Without dead ends: 5561 [2022-07-13 01:12:03,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-13 01:12:03,512 INFO L413 NwaCegarLoop]: 2838 mSDtfsCounter, 2602 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 5307 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:03,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 5307 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-13 01:12:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5561 states. [2022-07-13 01:12:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5561 to 3625. [2022-07-13 01:12:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2672 states have (on average 1.843562874251497) internal successors, (4926), 3600 states have internal predecessors, (4926), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:12:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 4976 transitions. [2022-07-13 01:12:03,547 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 4976 transitions. Word has length 36 [2022-07-13 01:12:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:03,547 INFO L495 AbstractCegarLoop]: Abstraction has 3625 states and 4976 transitions. [2022-07-13 01:12:03,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-13 01:12:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 4976 transitions. [2022-07-13 01:12:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 01:12:03,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:03,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:03,571 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-13 01:12:03,755 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-13 01:12:03,756 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1782356879, now seen corresponding path program 1 times [2022-07-13 01:12:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:03,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23368568] [2022-07-13 01:12:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:03,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:03,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:03,758 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-13 01:12:03,759 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-13 01:12:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:03,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:12:03,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:03,981 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-13 01:12:03,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:03,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:03,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23368568] [2022-07-13 01:12:03,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23368568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:03,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:03,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:12:03,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965106577] [2022-07-13 01:12:03,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:03,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:12:03,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:03,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:12:03,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:12:03,985 INFO L87 Difference]: Start difference. First operand 3625 states and 4976 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-13 01:12:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:04,040 INFO L93 Difference]: Finished difference Result 3613 states and 4952 transitions. [2022-07-13 01:12:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:12:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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 40 [2022-07-13 01:12:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:04,044 INFO L225 Difference]: With dead ends: 3613 [2022-07-13 01:12:04,044 INFO L226 Difference]: Without dead ends: 3613 [2022-07-13 01:12:04,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-13 01:12:04,044 INFO L413 NwaCegarLoop]: 2193 mSDtfsCounter, 1152 mSDsluCounter, 3221 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 5414 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:04,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 5414 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:12:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2022-07-13 01:12:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3613. [2022-07-13 01:12:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 2660 states have (on average 1.8428571428571427) internal successors, (4902), 3588 states have internal predecessors, (4902), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:12:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 4952 transitions. [2022-07-13 01:12:04,075 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 4952 transitions. Word has length 40 [2022-07-13 01:12:04,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:04,075 INFO L495 AbstractCegarLoop]: Abstraction has 3613 states and 4952 transitions. [2022-07-13 01:12:04,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-13 01:12:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 4952 transitions. [2022-07-13 01:12:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 01:12:04,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:04,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:04,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-13 01:12:04,283 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-13 01:12:04,283 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:04,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:04,284 INFO L85 PathProgramCache]: Analyzing trace with hash -263031357, now seen corresponding path program 1 times [2022-07-13 01:12:04,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:04,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063812813] [2022-07-13 01:12:04,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:04,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:04,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:04,286 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-13 01:12:04,288 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-13 01:12:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:04,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:12:04,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:04,633 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-13 01:12:04,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:04,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:04,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063812813] [2022-07-13 01:12:04,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063812813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:04,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:04,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:12:04,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877058001] [2022-07-13 01:12:04,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:04,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:12:04,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:04,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:12:04,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:12:04,636 INFO L87 Difference]: Start difference. First operand 3613 states and 4952 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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-13 01:12:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:04,935 INFO L93 Difference]: Finished difference Result 5433 states and 7161 transitions. [2022-07-13 01:12:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:12:04,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-07-13 01:12:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:04,941 INFO L225 Difference]: With dead ends: 5433 [2022-07-13 01:12:04,941 INFO L226 Difference]: Without dead ends: 5433 [2022-07-13 01:12:04,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-13 01:12:04,941 INFO L413 NwaCegarLoop]: 2282 mSDtfsCounter, 1568 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 4321 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:04,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 4321 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:12:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2022-07-13 01:12:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 4630. [2022-07-13 01:12:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 3670 states have (on average 1.8258855585831062) internal successors, (6701), 4595 states have internal predecessors, (6701), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 01:12:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 6771 transitions. [2022-07-13 01:12:05,008 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 6771 transitions. Word has length 48 [2022-07-13 01:12:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:05,008 INFO L495 AbstractCegarLoop]: Abstraction has 4630 states and 6771 transitions. [2022-07-13 01:12:05,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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-13 01:12:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 6771 transitions. [2022-07-13 01:12:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 01:12:05,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:05,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:05,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-13 01:12:05,216 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-13 01:12:05,217 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash -435335443, now seen corresponding path program 1 times [2022-07-13 01:12:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:05,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787464977] [2022-07-13 01:12:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:05,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:05,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:05,220 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-13 01:12:05,222 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-13 01:12:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:05,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:12:05,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:05,487 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-13 01:12:05,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:05,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:05,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787464977] [2022-07-13 01:12:05,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787464977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:05,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:05,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:12:05,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285310304] [2022-07-13 01:12:05,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:05,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:12:05,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:05,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:12:05,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:12:05,489 INFO L87 Difference]: Start difference. First operand 4630 states and 6771 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-13 01:12:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:05,542 INFO L93 Difference]: Finished difference Result 5942 states and 8145 transitions. [2022-07-13 01:12:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:12:05,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-07-13 01:12:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:05,556 INFO L225 Difference]: With dead ends: 5942 [2022-07-13 01:12:05,557 INFO L226 Difference]: Without dead ends: 5942 [2022-07-13 01:12:05,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-13 01:12:05,558 INFO L413 NwaCegarLoop]: 3432 mSDtfsCounter, 2151 mSDsluCounter, 4915 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 8347 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:05,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 8347 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:12:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2022-07-13 01:12:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 4588. [2022-07-13 01:12:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4588 states, 3628 states have (on average 1.8277287761852261) internal successors, (6631), 4553 states have internal predecessors, (6631), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 01:12:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 6701 transitions. [2022-07-13 01:12:05,607 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 6701 transitions. Word has length 51 [2022-07-13 01:12:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:05,608 INFO L495 AbstractCegarLoop]: Abstraction has 4588 states and 6701 transitions. [2022-07-13 01:12:05,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-13 01:12:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 6701 transitions. [2022-07-13 01:12:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 01:12:05,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:05,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:05,636 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-13 01:12:05,818 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-13 01:12:05,818 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:05,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:05,819 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-07-13 01:12:05,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:05,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932888240] [2022-07-13 01:12:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:05,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:05,837 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-13 01:12:05,838 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-13 01:12:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:06,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:12:06,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:06,137 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-13 01:12:06,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:06,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:06,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932888240] [2022-07-13 01:12:06,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932888240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:06,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:06,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:12:06,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962758120] [2022-07-13 01:12:06,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:06,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:12:06,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:06,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:12:06,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:12:06,139 INFO L87 Difference]: Start difference. First operand 4588 states and 6701 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-13 01:12:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:06,211 INFO L93 Difference]: Finished difference Result 5678 states and 7631 transitions. [2022-07-13 01:12:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:12:06,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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 54 [2022-07-13 01:12:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:06,216 INFO L225 Difference]: With dead ends: 5678 [2022-07-13 01:12:06,216 INFO L226 Difference]: Without dead ends: 5678 [2022-07-13 01:12:06,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:12:06,218 INFO L413 NwaCegarLoop]: 3694 mSDtfsCounter, 2142 mSDsluCounter, 5226 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 8920 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:06,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 8920 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:12:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2022-07-13 01:12:06,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 4570. [2022-07-13 01:12:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4570 states, 3610 states have (on average 1.8285318559556787) internal successors, (6601), 4535 states have internal predecessors, (6601), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 01:12:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4570 states to 4570 states and 6671 transitions. [2022-07-13 01:12:06,253 INFO L78 Accepts]: Start accepts. Automaton has 4570 states and 6671 transitions. Word has length 54 [2022-07-13 01:12:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:06,253 INFO L495 AbstractCegarLoop]: Abstraction has 4570 states and 6671 transitions. [2022-07-13 01:12:06,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-13 01:12:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4570 states and 6671 transitions. [2022-07-13 01:12:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 01:12:06,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:06,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:06,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-13 01:12:06,463 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-13 01:12:06,463 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:06,464 INFO L85 PathProgramCache]: Analyzing trace with hash -345082942, now seen corresponding path program 1 times [2022-07-13 01:12:06,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:06,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966955118] [2022-07-13 01:12:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:06,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:06,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:06,480 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-13 01:12:06,499 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-13 01:12:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:06,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:12:06,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:06,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 01:12:06,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 01:12:06,808 INFO L356 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2022-07-13 01:12:06,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 36 [2022-07-13 01:12:06,847 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-13 01:12:06,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2022-07-13 01:12:06,862 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-13 01:12:06,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:06,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:06,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966955118] [2022-07-13 01:12:06,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966955118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:06,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:06,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:12:06,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269875443] [2022-07-13 01:12:06,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:06,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:12:06,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:06,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:12:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:12:06,864 INFO L87 Difference]: Start difference. First operand 4570 states and 6671 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:12:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:08,149 INFO L93 Difference]: Finished difference Result 4797 states and 6909 transitions. [2022-07-13 01:12:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:12:08,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-13 01:12:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:08,157 INFO L225 Difference]: With dead ends: 4797 [2022-07-13 01:12:08,157 INFO L226 Difference]: Without dead ends: 4797 [2022-07-13 01:12:08,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-13 01:12:08,157 INFO L413 NwaCegarLoop]: 2071 mSDtfsCounter, 1031 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:08,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 5369 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 132 Unchecked, 1.2s Time] [2022-07-13 01:12:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2022-07-13 01:12:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4536. [2022-07-13 01:12:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4536 states, 3576 states have (on average 1.8361297539149888) internal successors, (6566), 4501 states have internal predecessors, (6566), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 01:12:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6636 transitions. [2022-07-13 01:12:08,237 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6636 transitions. Word has length 57 [2022-07-13 01:12:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:08,237 INFO L495 AbstractCegarLoop]: Abstraction has 4536 states and 6636 transitions. [2022-07-13 01:12:08,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:12:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6636 transitions. [2022-07-13 01:12:08,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 01:12:08,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:08,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:08,261 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-13 01:12:08,447 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-13 01:12:08,447 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash 122106401, now seen corresponding path program 1 times [2022-07-13 01:12:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:08,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113834917] [2022-07-13 01:12:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:08,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:08,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:08,450 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-13 01:12:08,490 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-13 01:12:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:08,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:12:08,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:08,918 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-13 01:12:08,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:08,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:08,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113834917] [2022-07-13 01:12:08,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113834917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:08,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:08,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:12:08,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574903550] [2022-07-13 01:12:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:08,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:12:08,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:08,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:12:08,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:12:08,920 INFO L87 Difference]: Start difference. First operand 4536 states and 6636 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-13 01:12:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:09,088 INFO L93 Difference]: Finished difference Result 6338 states and 8912 transitions. [2022-07-13 01:12:09,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:12:09,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-13 01:12:09,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:09,096 INFO L225 Difference]: With dead ends: 6338 [2022-07-13 01:12:09,096 INFO L226 Difference]: Without dead ends: 6338 [2022-07-13 01:12:09,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-13 01:12:09,097 INFO L413 NwaCegarLoop]: 2414 mSDtfsCounter, 1265 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:09,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 4482 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:12:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2022-07-13 01:12:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 5609. [2022-07-13 01:12:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5609 states, 4641 states have (on average 1.810385692738634) internal successors, (8402), 5563 states have internal predecessors, (8402), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:12:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 8494 transitions. [2022-07-13 01:12:09,157 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 8494 transitions. Word has length 59 [2022-07-13 01:12:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:09,157 INFO L495 AbstractCegarLoop]: Abstraction has 5609 states and 8494 transitions. [2022-07-13 01:12:09,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-13 01:12:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 8494 transitions. [2022-07-13 01:12:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 01:12:09,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:09,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:09,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-13 01:12:09,369 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-13 01:12:09,371 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-07-13 01:12:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:09,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057711914] [2022-07-13 01:12:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:09,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:09,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:09,387 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-13 01:12:09,389 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-13 01:12:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:09,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:12:09,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:09,848 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-13 01:12:09,852 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-13 01:12:10,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:12:10,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 01:12:10,140 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:12:10,140 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-13 01:12:10,148 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-13 01:12:10,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:10,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:10,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057711914] [2022-07-13 01:12:10,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057711914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:10,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:10,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:12:10,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547224957] [2022-07-13 01:12:10,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:10,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:12:10,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:10,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:12:10,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:12:10,149 INFO L87 Difference]: Start difference. First operand 5609 states and 8494 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-13 01:12:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:13,966 INFO L93 Difference]: Finished difference Result 8028 states and 12217 transitions. [2022-07-13 01:12:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:12:13,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-13 01:12:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:13,974 INFO L225 Difference]: With dead ends: 8028 [2022-07-13 01:12:13,974 INFO L226 Difference]: Without dead ends: 8028 [2022-07-13 01:12:13,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-13 01:12:13,976 INFO L413 NwaCegarLoop]: 1039 mSDtfsCounter, 2474 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2488 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:13,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2488 Valid, 1766 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-13 01:12:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8028 states. [2022-07-13 01:12:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8028 to 5369. [2022-07-13 01:12:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5369 states, 4485 states have (on average 1.7438127090301003) internal successors, (7821), 5323 states have internal predecessors, (7821), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:12:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 7913 transitions. [2022-07-13 01:12:14,055 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 7913 transitions. Word has length 62 [2022-07-13 01:12:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:14,056 INFO L495 AbstractCegarLoop]: Abstraction has 5369 states and 7913 transitions. [2022-07-13 01:12:14,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-13 01:12:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 7913 transitions. [2022-07-13 01:12:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:12:14,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:14,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:14,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-13 01:12:14,267 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-13 01:12:14,267 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-07-13 01:12:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:14,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487171007] [2022-07-13 01:12:14,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:14,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:14,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:14,270 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-13 01:12:14,271 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-13 01:12:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:14,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:12:14,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:14,574 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-13 01:12:14,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:12:14,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-13 01:12:14,603 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-13 01:12:14,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:14,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:14,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487171007] [2022-07-13 01:12:14,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487171007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:14,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:14,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:12:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273504873] [2022-07-13 01:12:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:14,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:12:14,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:14,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:12:14,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:12:14,605 INFO L87 Difference]: Start difference. First operand 5369 states and 7913 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-13 01:12:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:17,630 INFO L93 Difference]: Finished difference Result 5368 states and 7910 transitions. [2022-07-13 01:12:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:12:17,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-07-13 01:12:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:17,636 INFO L225 Difference]: With dead ends: 5368 [2022-07-13 01:12:17,636 INFO L226 Difference]: Without dead ends: 5368 [2022-07-13 01:12:17,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:12:17,636 INFO L413 NwaCegarLoop]: 2112 mSDtfsCounter, 4 mSDsluCounter, 3458 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5570 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:17,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5570 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-13 01:12:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2022-07-13 01:12:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5368. [2022-07-13 01:12:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5368 states, 4485 states have (on average 1.7431438127090302) internal successors, (7818), 5322 states have internal predecessors, (7818), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:12:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7910 transitions. [2022-07-13 01:12:17,683 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7910 transitions. Word has length 67 [2022-07-13 01:12:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:17,684 INFO L495 AbstractCegarLoop]: Abstraction has 5368 states and 7910 transitions. [2022-07-13 01:12:17,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-13 01:12:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7910 transitions. [2022-07-13 01:12:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:12:17,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:17,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:17,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-13 01:12:17,892 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-13 01:12:17,892 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:17,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-07-13 01:12:17,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:17,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194522239] [2022-07-13 01:12:17,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:17,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:17,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:17,895 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-13 01:12:17,896 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-13 01:12:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:18,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:12:18,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:18,199 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-13 01:12:18,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:12:18,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:12:18,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-13 01:12:18,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 01:12:18,261 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-13 01:12:18,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:18,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:18,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194522239] [2022-07-13 01:12:18,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194522239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:18,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:18,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:12:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134470316] [2022-07-13 01:12:18,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:18,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:12:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:18,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:12:18,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:12:18,264 INFO L87 Difference]: Start difference. First operand 5368 states and 7910 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-13 01:12:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:22,653 INFO L93 Difference]: Finished difference Result 5367 states and 7907 transitions. [2022-07-13 01:12:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:12:22,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-07-13 01:12:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:22,659 INFO L225 Difference]: With dead ends: 5367 [2022-07-13 01:12:22,659 INFO L226 Difference]: Without dead ends: 5367 [2022-07-13 01:12:22,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:12:22,659 INFO L413 NwaCegarLoop]: 2112 mSDtfsCounter, 2 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5571 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:22,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5571 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-13 01:12:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2022-07-13 01:12:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 5367. [2022-07-13 01:12:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5367 states, 4482 states have (on average 1.7436412315930387) internal successors, (7815), 5321 states have internal predecessors, (7815), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:12:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5367 states to 5367 states and 7907 transitions. [2022-07-13 01:12:22,696 INFO L78 Accepts]: Start accepts. Automaton has 5367 states and 7907 transitions. Word has length 67 [2022-07-13 01:12:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:22,696 INFO L495 AbstractCegarLoop]: Abstraction has 5367 states and 7907 transitions. [2022-07-13 01:12:22,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-13 01:12:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 5367 states and 7907 transitions. [2022-07-13 01:12:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:12:22,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:22,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:22,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-13 01:12:22,910 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-13 01:12:22,911 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:22,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:22,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564532, now seen corresponding path program 1 times [2022-07-13 01:12:22,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:22,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709447658] [2022-07-13 01:12:22,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:22,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:22,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:22,914 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-13 01:12:22,914 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-13 01:12:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:23,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:12:23,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:23,222 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-13 01:12:23,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:12:23,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-13 01:12:23,273 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-13 01:12:23,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:23,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:23,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709447658] [2022-07-13 01:12:23,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709447658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:23,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:23,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:12:23,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170974090] [2022-07-13 01:12:23,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:23,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:12:23,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:23,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:12:23,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:12:23,275 INFO L87 Difference]: Start difference. First operand 5367 states and 7907 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-13 01:12:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:26,643 INFO L93 Difference]: Finished difference Result 5366 states and 7903 transitions. [2022-07-13 01:12:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:12:26,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-07-13 01:12:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:26,649 INFO L225 Difference]: With dead ends: 5366 [2022-07-13 01:12:26,649 INFO L226 Difference]: Without dead ends: 5366 [2022-07-13 01:12:26,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:12:26,650 INFO L413 NwaCegarLoop]: 2110 mSDtfsCounter, 4 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5565 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:26,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5565 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-13 01:12:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5366 states. [2022-07-13 01:12:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5366 to 5366. [2022-07-13 01:12:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5366 states, 4482 states have (on average 1.7427487728692548) internal successors, (7811), 5320 states have internal predecessors, (7811), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:12:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5366 states to 5366 states and 7903 transitions. [2022-07-13 01:12:26,727 INFO L78 Accepts]: Start accepts. Automaton has 5366 states and 7903 transitions. Word has length 67 [2022-07-13 01:12:26,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:26,727 INFO L495 AbstractCegarLoop]: Abstraction has 5366 states and 7903 transitions. [2022-07-13 01:12:26,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-13 01:12:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 5366 states and 7903 transitions. [2022-07-13 01:12:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:12:26,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:26,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:26,759 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-13 01:12:26,928 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-13 01:12:26,929 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:26,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564533, now seen corresponding path program 1 times [2022-07-13 01:12:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:26,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90893412] [2022-07-13 01:12:26,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:26,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:26,931 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-13 01:12:26,933 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-13 01:12:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:27,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:12:27,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:27,256 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-13 01:12:27,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:12:27,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:12:27,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-13 01:12:27,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 01:12:27,314 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-13 01:12:27,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:27,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:27,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90893412] [2022-07-13 01:12:27,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90893412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:27,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:27,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:12:27,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706071758] [2022-07-13 01:12:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:27,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:12:27,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:27,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:12:27,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:12:27,316 INFO L87 Difference]: Start difference. First operand 5366 states and 7903 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-13 01:12:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:31,872 INFO L93 Difference]: Finished difference Result 5365 states and 7899 transitions. [2022-07-13 01:12:31,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:12:31,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-07-13 01:12:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:31,877 INFO L225 Difference]: With dead ends: 5365 [2022-07-13 01:12:31,878 INFO L226 Difference]: Without dead ends: 5365 [2022-07-13 01:12:31,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:12:31,878 INFO L413 NwaCegarLoop]: 2110 mSDtfsCounter, 2 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5566 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:31,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5566 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-13 01:12:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2022-07-13 01:12:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 5365. [2022-07-13 01:12:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4478 states have (on average 1.7434122376060741) internal successors, (7807), 5319 states have internal predecessors, (7807), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:12:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 7899 transitions. [2022-07-13 01:12:31,918 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 7899 transitions. Word has length 67 [2022-07-13 01:12:31,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:31,918 INFO L495 AbstractCegarLoop]: Abstraction has 5365 states and 7899 transitions. [2022-07-13 01:12:31,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-13 01:12:31,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 7899 transitions. [2022-07-13 01:12:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 01:12:31,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:31,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:31,931 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-13 01:12:32,131 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-13 01:12:32,131 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:32,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1243544783, now seen corresponding path program 1 times [2022-07-13 01:12:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:32,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504908007] [2022-07-13 01:12:32,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:32,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:32,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:32,134 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-13 01:12:32,134 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-13 01:12:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:32,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:12:32,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:32,472 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-13 01:12:32,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:12:32,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:32,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504908007] [2022-07-13 01:12:32,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504908007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:12:32,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:12:32,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:12:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369120459] [2022-07-13 01:12:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:12:32,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:12:32,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:32,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:12:32,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:12:32,475 INFO L87 Difference]: Start difference. First operand 5365 states and 7899 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:12:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:32,545 INFO L93 Difference]: Finished difference Result 5368 states and 7908 transitions. [2022-07-13 01:12:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:12:32,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-07-13 01:12:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:32,562 INFO L225 Difference]: With dead ends: 5368 [2022-07-13 01:12:32,562 INFO L226 Difference]: Without dead ends: 5368 [2022-07-13 01:12:32,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-13 01:12:32,563 INFO L413 NwaCegarLoop]: 2109 mSDtfsCounter, 2 mSDsluCounter, 4210 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6319 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:32,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6319 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:12:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2022-07-13 01:12:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5368. [2022-07-13 01:12:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5368 states, 4480 states have (on average 1.7433035714285714) internal successors, (7810), 5322 states have internal predecessors, (7810), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:12:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7908 transitions. [2022-07-13 01:12:32,618 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7908 transitions. Word has length 75 [2022-07-13 01:12:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:32,618 INFO L495 AbstractCegarLoop]: Abstraction has 5368 states and 7908 transitions. [2022-07-13 01:12:32,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:12:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7908 transitions. [2022-07-13 01:12:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 01:12:32,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:32,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:32,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-13 01:12:32,829 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-13 01:12:32,829 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:32,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:32,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1194961360, now seen corresponding path program 1 times [2022-07-13 01:12:32,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:32,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118018078] [2022-07-13 01:12:32,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:12:32,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:32,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:32,831 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-13 01:12:32,832 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-13 01:12:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:12:33,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:12:33,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:33,227 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-13 01:12:33,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:12:33,284 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-13 01:12:33,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:33,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118018078] [2022-07-13 01:12:33,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118018078] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:12:33,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:12:33,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-13 01:12:33,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978553745] [2022-07-13 01:12:33,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:12:33,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:12:33,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:12:33,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:12:33,285 INFO L87 Difference]: Start difference. First operand 5368 states and 7908 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:12:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:33,457 INFO L93 Difference]: Finished difference Result 5380 states and 7930 transitions. [2022-07-13 01:12:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 01:12:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-13 01:12:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:33,469 INFO L225 Difference]: With dead ends: 5380 [2022-07-13 01:12:33,469 INFO L226 Difference]: Without dead ends: 5380 [2022-07-13 01:12:33,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-13 01:12:33,470 INFO L413 NwaCegarLoop]: 2109 mSDtfsCounter, 12 mSDsluCounter, 12611 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14720 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:33,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14720 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:12:33,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2022-07-13 01:12:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 5378. [2022-07-13 01:12:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5378 states, 4489 states have (on average 1.7431499220316329) internal successors, (7825), 5331 states have internal predecessors, (7825), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:12:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 7923 transitions. [2022-07-13 01:12:33,543 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 7923 transitions. Word has length 76 [2022-07-13 01:12:33,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:33,543 INFO L495 AbstractCegarLoop]: Abstraction has 5378 states and 7923 transitions. [2022-07-13 01:12:33,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:12:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 7923 transitions. [2022-07-13 01:12:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 01:12:33,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:33,544 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:33,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-13 01:12:33,753 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-13 01:12:33,754 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1708838159, now seen corresponding path program 2 times [2022-07-13 01:12:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:33,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748188883] [2022-07-13 01:12:33,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:12:33,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:33,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:33,757 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-13 01:12:33,757 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-13 01:12:34,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 01:12:34,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:12:34,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:12:34,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:12:34,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:12:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:12:34,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:34,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748188883] [2022-07-13 01:12:34,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748188883] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:12:34,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:12:34,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-13 01:12:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859747030] [2022-07-13 01:12:34,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:12:34,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 01:12:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:34,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 01:12:34,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 01:12:34,500 INFO L87 Difference]: Start difference. First operand 5378 states and 7923 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:12:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:35,054 INFO L93 Difference]: Finished difference Result 5399 states and 7971 transitions. [2022-07-13 01:12:35,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 01:12:35,057 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2022-07-13 01:12:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:35,073 INFO L225 Difference]: With dead ends: 5399 [2022-07-13 01:12:35,073 INFO L226 Difference]: Without dead ends: 5395 [2022-07-13 01:12:35,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-13 01:12:35,076 INFO L413 NwaCegarLoop]: 2112 mSDtfsCounter, 56 mSDsluCounter, 16839 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 18951 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:35,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 18951 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:12:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2022-07-13 01:12:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 5387. [2022-07-13 01:12:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5387 states, 4498 states have (on average 1.7423299244108492) internal successors, (7837), 5340 states have internal predecessors, (7837), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:12:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5387 states to 5387 states and 7935 transitions. [2022-07-13 01:12:35,141 INFO L78 Accepts]: Start accepts. Automaton has 5387 states and 7935 transitions. Word has length 79 [2022-07-13 01:12:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:35,141 INFO L495 AbstractCegarLoop]: Abstraction has 5387 states and 7935 transitions. [2022-07-13 01:12:35,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:12:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 7935 transitions. [2022-07-13 01:12:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 01:12:35,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:35,142 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:35,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-13 01:12:35,354 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-13 01:12:35,354 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:35,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1472099985, now seen corresponding path program 3 times [2022-07-13 01:12:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:35,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772966893] [2022-07-13 01:12:35,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 01:12:35,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:35,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:35,357 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-13 01:12:35,358 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-13 01:12:36,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 01:12:36,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:12:36,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 01:12:36,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:12:36,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:12:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:12:36,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:36,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772966893] [2022-07-13 01:12:36,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772966893] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:12:36,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:12:36,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-13 01:12:36,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32430860] [2022-07-13 01:12:36,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:12:36,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 01:12:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:36,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 01:12:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 01:12:36,769 INFO L87 Difference]: Start difference. First operand 5387 states and 7935 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:12:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:39,464 INFO L93 Difference]: Finished difference Result 5429 states and 8072 transitions. [2022-07-13 01:12:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 01:12:39,466 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2022-07-13 01:12:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:39,475 INFO L225 Difference]: With dead ends: 5429 [2022-07-13 01:12:39,476 INFO L226 Difference]: Without dead ends: 5423 [2022-07-13 01:12:39,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 01:12:39,478 INFO L413 NwaCegarLoop]: 2116 mSDtfsCounter, 189 mSDsluCounter, 23219 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 25335 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:39,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 25335 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 01:12:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2022-07-13 01:12:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 5405. [2022-07-13 01:12:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5405 states, 4516 states have (on average 1.7404782993799823) internal successors, (7860), 5358 states have internal predecessors, (7860), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:12:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 7958 transitions. [2022-07-13 01:12:39,535 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 7958 transitions. Word has length 85 [2022-07-13 01:12:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:39,535 INFO L495 AbstractCegarLoop]: Abstraction has 5405 states and 7958 transitions. [2022-07-13 01:12:39,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:12:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 7958 transitions. [2022-07-13 01:12:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 01:12:39,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:39,540 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:39,552 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-13 01:12:39,742 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-13 01:12:39,743 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:39,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1934666287, now seen corresponding path program 4 times [2022-07-13 01:12:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:39,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296870508] [2022-07-13 01:12:39,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 01:12:39,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:39,746 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-13 01:12:39,747 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-13 01:12:40,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 01:12:40,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:12:40,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 01:12:40,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:12:40,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:12:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:12:41,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:41,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296870508] [2022-07-13 01:12:41,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296870508] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:12:41,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:12:41,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-13 01:12:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492141548] [2022-07-13 01:12:41,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:12:41,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 01:12:41,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:12:41,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 01:12:41,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 01:12:41,698 INFO L87 Difference]: Start difference. First operand 5405 states and 7958 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:12:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:12:54,492 INFO L93 Difference]: Finished difference Result 5485 states and 8175 transitions. [2022-07-13 01:12:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-13 01:12:54,494 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2022-07-13 01:12:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:12:54,504 INFO L225 Difference]: With dead ends: 5485 [2022-07-13 01:12:54,504 INFO L226 Difference]: Without dead ends: 5481 [2022-07-13 01:12:54,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-13 01:12:54,507 INFO L413 NwaCegarLoop]: 2129 mSDtfsCounter, 406 mSDsluCounter, 48856 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 50985 SdHoareTripleChecker+Invalid, 3467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:12:54,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 50985 Invalid, 3467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-13 01:12:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2022-07-13 01:12:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5439. [2022-07-13 01:12:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 4550 states have (on average 1.7375824175824175) internal successors, (7906), 5392 states have internal predecessors, (7906), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:12:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 8004 transitions. [2022-07-13 01:12:54,561 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 8004 transitions. Word has length 97 [2022-07-13 01:12:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:12:54,561 INFO L495 AbstractCegarLoop]: Abstraction has 5439 states and 8004 transitions. [2022-07-13 01:12:54,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:12:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 8004 transitions. [2022-07-13 01:12:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 01:12:54,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:12:54,564 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:12:54,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-07-13 01:12:54,775 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-13 01:12:54,776 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:12:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:12:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1997795441, now seen corresponding path program 5 times [2022-07-13 01:12:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:12:54,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902120673] [2022-07-13 01:12:54,777 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:12:54,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:12:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:12:54,779 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-13 01:12:54,779 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-13 01:12:56,244 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:12:56,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:12:56,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-13 01:12:56,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:12:56,293 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-13 01:12:56,374 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:12:56,374 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 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 01:12:56,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:12:56,472 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 22 treesize of output 10 [2022-07-13 01:12:57,582 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:12:57,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-13 01:12:57,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-13 01:12:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-13 01:12:57,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:12:57,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2712) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-13 01:12:57,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:12:57,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902120673] [2022-07-13 01:12:57,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902120673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:12:57,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [42596852] [2022-07-13 01:12:57,813 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:12:57,813 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:12:57,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:12:57,814 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 01:12:57,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-07-13 01:14:23,009 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:14:23,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:14:23,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-13 01:14:23,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:14:23,284 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-13 01:14:23,357 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:14:23,358 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 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 01:14:23,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:14:23,407 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 22 treesize of output 10 [2022-07-13 01:14:24,370 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:14:24,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-13 01:14:24,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-13 01:14:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-13 01:14:24,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:14:24,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [42596852] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:14:24,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:14:24,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-13 01:14:24,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489634908] [2022-07-13 01:14:24,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:14:24,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:14:24,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:14:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:14:24,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=93, Unknown=12, NotChecked=20, Total=156 [2022-07-13 01:14:24,563 INFO L87 Difference]: Start difference. First operand 5439 states and 8004 transitions. Second operand has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:14:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:14:29,449 INFO L93 Difference]: Finished difference Result 7994 states and 12060 transitions. [2022-07-13 01:14:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:14:29,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-07-13 01:14:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:14:29,460 INFO L225 Difference]: With dead ends: 7994 [2022-07-13 01:14:29,460 INFO L226 Difference]: Without dead ends: 7990 [2022-07-13 01:14:29,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 140 SyntacticMatches, 93 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=44, Invalid=128, Unknown=14, NotChecked=24, Total=210 [2022-07-13 01:14:29,461 INFO L413 NwaCegarLoop]: 1369 mSDtfsCounter, 1592 mSDsluCounter, 6460 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 7829 SdHoareTripleChecker+Invalid, 8322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4779 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-13 01:14:29,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 7829 Invalid, 8322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3531 Invalid, 0 Unknown, 4779 Unchecked, 4.7s Time] [2022-07-13 01:14:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7990 states. [2022-07-13 01:14:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7990 to 5487. [2022-07-13 01:14:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5487 states, 4598 states have (on average 1.729447585906916) internal successors, (7952), 5439 states have internal predecessors, (7952), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:14:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 8050 transitions. [2022-07-13 01:14:29,512 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 8050 transitions. Word has length 119 [2022-07-13 01:14:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:14:29,512 INFO L495 AbstractCegarLoop]: Abstraction has 5487 states and 8050 transitions. [2022-07-13 01:14:29,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:14:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 8050 transitions. [2022-07-13 01:14:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 01:14:29,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:14:29,513 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:14:29,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-07-13 01:14:29,750 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-13 01:14:29,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:14:29,919 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-07-13 01:14:29,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:14:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1997795440, now seen corresponding path program 1 times [2022-07-13 01:14:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:14:29,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011549376] [2022-07-13 01:14:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:14:29,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:14:29,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:14:29,928 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-13 01:14:29,929 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-13 01:14:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:14:30,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-13 01:14:30,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:14:30,749 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-13 01:14:30,819 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:14:30,819 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-13 01:14:30,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:14:30,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:14:30,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:14:30,906 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 22 treesize of output 10 [2022-07-13 01:14:30,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-13 01:14:30,948 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-13 01:14:30,954 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554))) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553)))) is different from true [2022-07-13 01:14:30,979 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-13 01:14:30,985 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560)))) is different from true [2022-07-13 01:14:30,991 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561))) (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-13 01:14:30,996 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563)))) is different from true [2022-07-13 01:14:31,001 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3566))) (exists ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3565))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-13 01:14:31,007 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568)))) is different from true [2022-07-13 01:14:31,012 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570)))) is different from true [2022-07-13 01:14:31,017 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3572))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3571)))) is different from true [2022-07-13 01:14:31,022 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:14:31,044 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:14:31,093 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:14:31,101 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3583))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3584)))) is different from true [2022-07-13 01:14:31,108 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586)))) is different from true [2022-07-13 01:14:31,136 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590)))) is different from true [2022-07-13 01:14:31,143 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592)))) is different from true [2022-07-13 01:14:31,158 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:14:31,164 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:14:31,171 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:14:31,176 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599))) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600)))) is different from true [2022-07-13 01:14:31,184 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3602))) (exists ((v_ArrVal_3601 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3601))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-13 01:14:31,190 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:14:31,195 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3605) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3606 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3606)))) is different from true [2022-07-13 01:14:31,200 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:14:31,205 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610)))) is different from true [2022-07-13 01:14:31,211 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:14:31,216 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613))) (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:14:31,237 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617)))) is different from true [2022-07-13 01:14:31,258 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622)))) is different from true [2022-07-13 01:14:31,266 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624)))) is different from true [2022-07-13 01:14:31,272 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626))) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625)))) is different from true [2022-07-13 01:14:31,277 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627))) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628)))) is different from true [2022-07-13 01:14:31,283 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3630 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3630) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3629)))) is different from true [2022-07-13 01:14:31,288 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:14:31,293 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3633))) (exists ((v_ArrVal_3634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3634)))) is different from true [2022-07-13 01:14:31,298 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636)))) is different from true [2022-07-13 01:14:31,304 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637)))) is different from true [2022-07-13 01:14:31,323 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:14:31,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-13 01:14:31,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-13 01:14:31,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-13 01:14:31,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 01:14:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 969 not checked. [2022-07-13 01:14:31,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:14:32,027 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2022-07-13 01:14:32,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:14:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011549376] [2022-07-13 01:14:32,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011549376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:14:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [729692712] [2022-07-13 01:14:32,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:14:32,033 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:14:32,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:14:32,034 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 01:14:32,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process