./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 08:27:30,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 08:27:30,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 08:27:30,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 08:27:30,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 08:27:30,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 08:27:30,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 08:27:30,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 08:27:30,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 08:27:30,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 08:27:30,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 08:27:30,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 08:27:30,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 08:27:30,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 08:27:30,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 08:27:30,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 08:27:30,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 08:27:30,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 08:27:30,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 08:27:30,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 08:27:30,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 08:27:30,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 08:27:30,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 08:27:30,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 08:27:30,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 08:27:30,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 08:27:30,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 08:27:30,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 08:27:30,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 08:27:30,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 08:27:30,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 08:27:30,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 08:27:30,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 08:27:30,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 08:27:30,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 08:27:30,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 08:27:30,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 08:27:30,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 08:27:30,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 08:27:30,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 08:27:30,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 08:27:30,959 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-12-28 08:27:30,978 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 08:27:30,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 08:27:30,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 08:27:30,979 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 08:27:30,979 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 08:27:30,980 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 08:27:30,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 08:27:30,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 08:27:30,980 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 08:27:30,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 08:27:30,981 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 08:27:30,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 08:27:30,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 08:27:30,982 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 08:27:30,982 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 08:27:30,982 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 08:27:30,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 08:27:30,983 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 08:27:30,983 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 08:27:30,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 08:27:30,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 08:27:30,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 08:27:30,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 08:27:30,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 08:27:30,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 08:27:30,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 08:27:30,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 08:27:30,984 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2021-12-28 08:27:31,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 08:27:31,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 08:27:31,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 08:27:31,281 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 08:27:31,283 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 08:27:31,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2021-12-28 08:27:31,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056603c3c/51989b2ab8574b2faaff5e7a015ac0ce/FLAG9fc59b8bf [2021-12-28 08:27:31,804 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 08:27:31,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2021-12-28 08:27:31,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056603c3c/51989b2ab8574b2faaff5e7a015ac0ce/FLAG9fc59b8bf [2021-12-28 08:27:31,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056603c3c/51989b2ab8574b2faaff5e7a015ac0ce [2021-12-28 08:27:31,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 08:27:31,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 08:27:31,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 08:27:31,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 08:27:31,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 08:27:31,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 08:27:31" (1/1) ... [2021-12-28 08:27:31,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ffdc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:31, skipping insertion in model container [2021-12-28 08:27:31,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 08:27:31" (1/1) ... [2021-12-28 08:27:31,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 08:27:31,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 08:27:32,343 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/busybox-1.22.0/basename-2.i[58078,58091] [2021-12-28 08:27:32,411 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 08:27:32,423 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-28 08:27:32,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f56e405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:32, skipping insertion in model container [2021-12-28 08:27:32,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 08:27:32,424 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-28 08:27:32,427 INFO L158 Benchmark]: Toolchain (without parser) took 589.60ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 29.6MB in the beginning and 45.4MB in the end (delta: -15.9MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2021-12-28 08:27:32,427 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 54.5MB. Free memory is still 37.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 08:27:32,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.28ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 29.4MB in the beginning and 45.4MB in the end (delta: -16.0MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2021-12-28 08:27:32,430 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.94ms. Allocated memory is still 54.5MB. Free memory is still 37.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.28ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 29.4MB in the beginning and 45.4MB in the end (delta: -16.0MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1515]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 08:27:33,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 08:27:33,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 08:27:33,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 08:27:33,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 08:27:33,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 08:27:33,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 08:27:33,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 08:27:33,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 08:27:33,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 08:27:33,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 08:27:33,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 08:27:33,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 08:27:33,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 08:27:33,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 08:27:33,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 08:27:33,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 08:27:33,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 08:27:33,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 08:27:33,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 08:27:33,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 08:27:33,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 08:27:33,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 08:27:33,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 08:27:33,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 08:27:33,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 08:27:33,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 08:27:33,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 08:27:33,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 08:27:33,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 08:27:33,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 08:27:33,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 08:27:33,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 08:27:33,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 08:27:33,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 08:27:33,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 08:27:33,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 08:27:33,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 08:27:33,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 08:27:33,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 08:27:33,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 08:27:33,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2021-12-28 08:27:33,969 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 08:27:33,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 08:27:33,970 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 08:27:33,970 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 08:27:33,970 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 08:27:33,971 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 08:27:33,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 08:27:33,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 08:27:33,972 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 08:27:33,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 08:27:33,973 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 08:27:33,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 08:27:33,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 08:27:33,973 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 08:27:33,973 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 08:27:33,973 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 08:27:33,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 08:27:33,974 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 08:27:33,974 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-28 08:27:33,974 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-28 08:27:33,974 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 08:27:33,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 08:27:33,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 08:27:33,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 08:27:33,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 08:27:33,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 08:27:33,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 08:27:33,975 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-28 08:27:33,975 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-28 08:27:33,975 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-28 08:27:33,975 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2021-12-28 08:27:34,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 08:27:34,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 08:27:34,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 08:27:34,259 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 08:27:34,260 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 08:27:34,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2021-12-28 08:27:34,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06037da68/244c73396b954cf1a042c4d2c05e730f/FLAG797a16fd6 [2021-12-28 08:27:34,718 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 08:27:34,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2021-12-28 08:27:34,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06037da68/244c73396b954cf1a042c4d2c05e730f/FLAG797a16fd6 [2021-12-28 08:27:35,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06037da68/244c73396b954cf1a042c4d2c05e730f [2021-12-28 08:27:35,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 08:27:35,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 08:27:35,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 08:27:35,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 08:27:35,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 08:27:35,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5cc28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35, skipping insertion in model container [2021-12-28 08:27:35,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 08:27:35,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 08:27:35,486 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/busybox-1.22.0/basename-2.i[58078,58091] [2021-12-28 08:27:35,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 08:27:35,538 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-28 08:27:35,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 08:27:35,596 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/busybox-1.22.0/basename-2.i[58078,58091] [2021-12-28 08:27:35,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 08:27:35,630 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 08:27:35,658 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/busybox-1.22.0/basename-2.i[58078,58091] [2021-12-28 08:27:35,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 08:27:35,749 INFO L208 MainTranslator]: Completed translation [2021-12-28 08:27:35,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35 WrapperNode [2021-12-28 08:27:35,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 08:27:35,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 08:27:35,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 08:27:35,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 08:27:35,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,818 INFO L137 Inliner]: procedures = 353, calls = 114, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 386 [2021-12-28 08:27:35,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 08:27:35,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 08:27:35,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 08:27:35,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 08:27:35,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 08:27:35,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 08:27:35,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 08:27:35,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 08:27:35,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (1/1) ... [2021-12-28 08:27:35,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 08:27:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:27:35,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 08:27:35,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 08:27:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-28 08:27:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-28 08:27:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 08:27:35,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 08:27:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 08:27:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-12-28 08:27:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 08:27:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-28 08:27:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-28 08:27:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-12-28 08:27:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 08:27:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2021-12-28 08:27:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 08:27:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 08:27:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 08:27:35,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 08:27:36,250 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 08:27:36,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 08:27:37,205 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 08:27:37,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 08:27:37,213 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-28 08:27:37,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 08:27:37 BoogieIcfgContainer [2021-12-28 08:27:37,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 08:27:37,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 08:27:37,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 08:27:37,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 08:27:37,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 08:27:35" (1/3) ... [2021-12-28 08:27:37,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e030ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 08:27:37, skipping insertion in model container [2021-12-28 08:27:37,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:35" (2/3) ... [2021-12-28 08:27:37,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e030ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 08:27:37, skipping insertion in model container [2021-12-28 08:27:37,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 08:27:37" (3/3) ... [2021-12-28 08:27:37,228 INFO L111 eAbstractionObserver]: Analyzing ICFG basename-2.i [2021-12-28 08:27:37,232 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 08:27:37,233 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2021-12-28 08:27:37,272 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 08:27:37,278 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 08:27:37,278 INFO L340 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2021-12-28 08:27:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 147 states have (on average 1.945578231292517) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 08:27:37,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:37,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 08:27:37,308 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:37,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2021-12-28 08:27:37,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:37,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19692964] [2021-12-28 08:27:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:37,322 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:37,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:37,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:37,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-28 08:27:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:37,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 08:27:37,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:37,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 08:27:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:27:37,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:37,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:37,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19692964] [2021-12-28 08:27:37,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19692964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:37,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:37,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 08:27:37,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070379946] [2021-12-28 08:27:37,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:37,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:27:37,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:37,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:27:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:37,544 INFO L87 Difference]: Start difference. First operand has 245 states, 147 states have (on average 1.945578231292517) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:37,923 INFO L93 Difference]: Finished difference Result 253 states and 287 transitions. [2021-12-28 08:27:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:27:37,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-28 08:27:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:37,931 INFO L225 Difference]: With dead ends: 253 [2021-12-28 08:27:37,931 INFO L226 Difference]: Without dead ends: 251 [2021-12-28 08:27:37,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:37,938 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 241 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:37,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 207 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 08:27:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-28 08:27:37,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2021-12-28 08:27:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 142 states have (on average 1.8591549295774648) internal successors, (264), 231 states have internal predecessors, (264), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 268 transitions. [2021-12-28 08:27:37,994 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 268 transitions. Word has length 3 [2021-12-28 08:27:37,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:37,994 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 268 transitions. [2021-12-28 08:27:37,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 268 transitions. [2021-12-28 08:27:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 08:27:37,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:37,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 08:27:38,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-28 08:27:38,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:38,196 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:38,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:38,197 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2021-12-28 08:27:38,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:38,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5306929] [2021-12-28 08:27:38,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:38,198 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:38,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:38,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:38,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-28 08:27:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:38,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 08:27:38,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:38,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 08:27:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:27:38,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:38,356 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:38,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5306929] [2021-12-28 08:27:38,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5306929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:38,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:38,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 08:27:38,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628181430] [2021-12-28 08:27:38,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:38,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:27:38,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:38,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:27:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:38,358 INFO L87 Difference]: Start difference. First operand 235 states and 268 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:38,918 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2021-12-28 08:27:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:27:38,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-28 08:27:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:38,926 INFO L225 Difference]: With dead ends: 234 [2021-12-28 08:27:38,926 INFO L226 Difference]: Without dead ends: 234 [2021-12-28 08:27:38,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:38,927 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:38,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 430 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 08:27:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-28 08:27:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2021-12-28 08:27:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 142 states have (on average 1.852112676056338) internal successors, (263), 230 states have internal predecessors, (263), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2021-12-28 08:27:38,944 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 3 [2021-12-28 08:27:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:38,945 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2021-12-28 08:27:38,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2021-12-28 08:27:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 08:27:38,945 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:38,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 08:27:38,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:39,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:39,146 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:39,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113961, now seen corresponding path program 1 times [2021-12-28 08:27:39,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:39,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009629450] [2021-12-28 08:27:39,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:39,147 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:39,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:39,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:39,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-28 08:27:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:39,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 08:27:39,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:39,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 08:27:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:27:39,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:39,290 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:39,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009629450] [2021-12-28 08:27:39,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009629450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:39,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:39,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 08:27:39,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517692225] [2021-12-28 08:27:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:39,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:27:39,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:39,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:27:39,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:27:39,292 INFO L87 Difference]: Start difference. First operand 234 states and 267 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:39,819 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2021-12-28 08:27:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:27:39,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-28 08:27:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:39,827 INFO L225 Difference]: With dead ends: 238 [2021-12-28 08:27:39,827 INFO L226 Difference]: Without dead ends: 238 [2021-12-28 08:27:39,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:27:39,828 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 17 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:39,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 431 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 08:27:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-28 08:27:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2021-12-28 08:27:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 232 states have internal predecessors, (265), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 269 transitions. [2021-12-28 08:27:39,836 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 269 transitions. Word has length 6 [2021-12-28 08:27:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:39,837 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 269 transitions. [2021-12-28 08:27:39,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 269 transitions. [2021-12-28 08:27:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 08:27:39,839 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:39,839 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:39,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:40,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:40,043 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2080656212, now seen corresponding path program 1 times [2021-12-28 08:27:40,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:40,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711532683] [2021-12-28 08:27:40,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:40,045 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:40,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:40,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:40,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-28 08:27:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:40,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 08:27:40,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:40,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 08:27:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:27:40,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:27:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:27:41,236 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:41,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711532683] [2021-12-28 08:27:41,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711532683] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:27:41,236 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 08:27:41,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-28 08:27:41,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883139506] [2021-12-28 08:27:41,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 08:27:41,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 08:27:41,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:41,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 08:27:41,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-28 08:27:41,237 INFO L87 Difference]: Start difference. First operand 236 states and 269 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:44,551 INFO L93 Difference]: Finished difference Result 242 states and 275 transitions. [2021-12-28 08:27:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 08:27:44,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-28 08:27:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:44,553 INFO L225 Difference]: With dead ends: 242 [2021-12-28 08:27:44,553 INFO L226 Difference]: Without dead ends: 242 [2021-12-28 08:27:44,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-28 08:27:44,554 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 31 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:44,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 1116 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-28 08:27:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-28 08:27:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-12-28 08:27:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 151 states have (on average 1.794701986754967) internal successors, (271), 238 states have internal predecessors, (271), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 275 transitions. [2021-12-28 08:27:44,559 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 275 transitions. Word has length 10 [2021-12-28 08:27:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:44,560 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 275 transitions. [2021-12-28 08:27:44,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 275 transitions. [2021-12-28 08:27:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-28 08:27:44,560 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:44,561 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:44,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-28 08:27:44,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:44,767 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1026813049, now seen corresponding path program 1 times [2021-12-28 08:27:44,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:44,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103170656] [2021-12-28 08:27:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:44,768 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:44,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:44,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:44,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-28 08:27:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:44,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 08:27:44,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:27:44,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:27:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:27:45,025 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:45,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103170656] [2021-12-28 08:27:45,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103170656] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:27:45,025 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 08:27:45,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-28 08:27:45,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862906667] [2021-12-28 08:27:45,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 08:27:45,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 08:27:45,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 08:27:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 08:27:45,026 INFO L87 Difference]: Start difference. First operand 242 states and 275 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:45,197 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2021-12-28 08:27:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 08:27:45,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-28 08:27:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:45,209 INFO L225 Difference]: With dead ends: 262 [2021-12-28 08:27:45,209 INFO L226 Difference]: Without dead ends: 262 [2021-12-28 08:27:45,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-12-28 08:27:45,211 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 24 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:45,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 1835 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 08:27:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-28 08:27:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-12-28 08:27:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 171 states have (on average 1.7017543859649122) internal successors, (291), 258 states have internal predecessors, (291), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 295 transitions. [2021-12-28 08:27:45,220 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 295 transitions. Word has length 19 [2021-12-28 08:27:45,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:45,220 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 295 transitions. [2021-12-28 08:27:45,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 295 transitions. [2021-12-28 08:27:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-28 08:27:45,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:45,222 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:45,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:45,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:45,434 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:45,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1411098840, now seen corresponding path program 2 times [2021-12-28 08:27:45,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:45,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907915295] [2021-12-28 08:27:45,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 08:27:45,436 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:45,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:45,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:45,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-28 08:27:45,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 08:27:45,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 08:27:45,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 08:27:45,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:45,658 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-28 08:27:45,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2021-12-28 08:27:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-12-28 08:27:45,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:45,867 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:45,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907915295] [2021-12-28 08:27:45,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907915295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:45,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:45,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-28 08:27:45,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772266093] [2021-12-28 08:27:45,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:45,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:27:45,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:45,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:27:45,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:45,868 INFO L87 Difference]: Start difference. First operand 262 states and 295 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:46,170 INFO L93 Difference]: Finished difference Result 277 states and 311 transitions. [2021-12-28 08:27:46,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:27:46,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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 39 [2021-12-28 08:27:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:46,172 INFO L225 Difference]: With dead ends: 277 [2021-12-28 08:27:46,172 INFO L226 Difference]: Without dead ends: 277 [2021-12-28 08:27:46,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:46,173 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 237 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:46,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 202 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 08:27:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-28 08:27:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2021-12-28 08:27:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 171 states have (on average 1.695906432748538) internal successors, (290), 257 states have internal predecessors, (290), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 294 transitions. [2021-12-28 08:27:46,178 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 294 transitions. Word has length 39 [2021-12-28 08:27:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:46,178 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 294 transitions. [2021-12-28 08:27:46,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 294 transitions. [2021-12-28 08:27:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-28 08:27:46,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:46,179 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:46,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-28 08:27:46,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:46,392 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1411098841, now seen corresponding path program 1 times [2021-12-28 08:27:46,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:46,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349973105] [2021-12-28 08:27:46,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:46,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:46,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:46,394 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:46,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-28 08:27:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:46,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 08:27:46,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:27:46,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:27:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 08:27:46,927 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:46,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349973105] [2021-12-28 08:27:46,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349973105] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:27:46,927 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 08:27:46,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-12-28 08:27:46,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269377314] [2021-12-28 08:27:46,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 08:27:46,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-28 08:27:46,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:46,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-28 08:27:46,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-28 08:27:46,928 INFO L87 Difference]: Start difference. First operand 261 states and 294 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:47,251 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2021-12-28 08:27:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 08:27:47,253 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 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 39 [2021-12-28 08:27:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:47,254 INFO L225 Difference]: With dead ends: 269 [2021-12-28 08:27:47,254 INFO L226 Difference]: Without dead ends: 269 [2021-12-28 08:27:47,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-28 08:27:47,255 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 30 mSDsluCounter, 3171 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:47,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 3441 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 08:27:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-28 08:27:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2021-12-28 08:27:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 179 states have (on average 1.664804469273743) internal successors, (298), 265 states have internal predecessors, (298), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 302 transitions. [2021-12-28 08:27:47,259 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 302 transitions. Word has length 39 [2021-12-28 08:27:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:47,260 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 302 transitions. [2021-12-28 08:27:47,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 08:27:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 302 transitions. [2021-12-28 08:27:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-28 08:27:47,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:47,263 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:47,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-28 08:27:47,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:47,477 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:47,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:47,478 INFO L85 PathProgramCache]: Analyzing trace with hash 233252627, now seen corresponding path program 2 times [2021-12-28 08:27:47,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:47,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269863706] [2021-12-28 08:27:47,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 08:27:47,479 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:47,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:47,480 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:47,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-28 08:27:47,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 08:27:47,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 08:27:47,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 08:27:47,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:47,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 08:27:47,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-28 08:27:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:27:47,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:47,947 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:47,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269863706] [2021-12-28 08:27:47,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269863706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:47,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:47,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 08:27:47,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210520727] [2021-12-28 08:27:47,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:47,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:27:47,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:47,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:27:47,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:27:47,949 INFO L87 Difference]: Start difference. First operand 269 states and 302 transitions. Second operand has 4 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) [2021-12-28 08:27:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:48,455 INFO L93 Difference]: Finished difference Result 284 states and 318 transitions. [2021-12-28 08:27:48,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:27:48,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 47 [2021-12-28 08:27:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:48,457 INFO L225 Difference]: With dead ends: 284 [2021-12-28 08:27:48,457 INFO L226 Difference]: Without dead ends: 284 [2021-12-28 08:27:48,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:27:48,458 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 275 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:48,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 158 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 08:27:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-12-28 08:27:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2021-12-28 08:27:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 264 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 301 transitions. [2021-12-28 08:27:48,462 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 301 transitions. Word has length 47 [2021-12-28 08:27:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:48,463 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 301 transitions. [2021-12-28 08:27:48,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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) [2021-12-28 08:27:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 301 transitions. [2021-12-28 08:27:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-28 08:27:48,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:48,464 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:48,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:48,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:48,671 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1065773764, now seen corresponding path program 1 times [2021-12-28 08:27:48,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:48,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927466691] [2021-12-28 08:27:48,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:48,672 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:48,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:48,673 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:48,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-28 08:27:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:48,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 08:27:48,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:49,082 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-28 08:27:49,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2021-12-28 08:27:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:27:49,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:49,105 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:49,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927466691] [2021-12-28 08:27:49,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927466691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:49,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:49,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 08:27:49,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927314450] [2021-12-28 08:27:49,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:49,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:27:49,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:27:49,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:49,106 INFO L87 Difference]: Start difference. First operand 268 states and 301 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:49,429 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2021-12-28 08:27:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:27:49,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 55 [2021-12-28 08:27:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:49,430 INFO L225 Difference]: With dead ends: 279 [2021-12-28 08:27:49,430 INFO L226 Difference]: Without dead ends: 279 [2021-12-28 08:27:49,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:49,431 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 222 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:49,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 211 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 08:27:49,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-28 08:27:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2021-12-28 08:27:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 296 transitions. [2021-12-28 08:27:49,435 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 296 transitions. Word has length 55 [2021-12-28 08:27:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:49,437 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 296 transitions. [2021-12-28 08:27:49,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2021-12-28 08:27:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-28 08:27:49,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:49,438 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:49,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:49,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:49,643 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:49,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1065773765, now seen corresponding path program 1 times [2021-12-28 08:27:49,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:49,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64696940] [2021-12-28 08:27:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:49,644 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:49,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:49,645 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:49,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-28 08:27:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:50,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 08:27:50,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:50,148 INFO L353 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2021-12-28 08:27:50,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2021-12-28 08:27:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:27:50,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:50,221 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:50,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64696940] [2021-12-28 08:27:50,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64696940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:50,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:50,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 08:27:50,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813727974] [2021-12-28 08:27:50,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:50,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 08:27:50,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:50,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 08:27:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 08:27:50,222 INFO L87 Difference]: Start difference. First operand 263 states and 296 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:51,551 INFO L93 Difference]: Finished difference Result 443 states and 507 transitions. [2021-12-28 08:27:51,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 08:27:51,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 55 [2021-12-28 08:27:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:51,554 INFO L225 Difference]: With dead ends: 443 [2021-12-28 08:27:51,554 INFO L226 Difference]: Without dead ends: 443 [2021-12-28 08:27:51,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 08:27:51,555 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 642 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:51,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [644 Valid, 779 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-28 08:27:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-12-28 08:27:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 367. [2021-12-28 08:27:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 283 states have (on average 1.7279151943462898) internal successors, (489), 362 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 08:27:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 495 transitions. [2021-12-28 08:27:51,561 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 495 transitions. Word has length 55 [2021-12-28 08:27:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:51,561 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 495 transitions. [2021-12-28 08:27:51,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 495 transitions. [2021-12-28 08:27:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-28 08:27:51,562 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:51,562 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:51,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:51,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:51,775 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2067963466, now seen corresponding path program 1 times [2021-12-28 08:27:51,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:51,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785940109] [2021-12-28 08:27:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:51,777 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:51,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:51,778 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:51,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-28 08:27:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:52,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 08:27:52,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:52,423 INFO L353 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2021-12-28 08:27:52,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2021-12-28 08:27:52,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 08:27:52,739 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-28 08:27:52,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2021-12-28 08:27:52,793 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 08:27:52,793 INFO L387 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 [2021-12-28 08:27:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:27:52,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:52,954 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:52,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785940109] [2021-12-28 08:27:52,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785940109] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:52,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:52,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 08:27:52,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991440131] [2021-12-28 08:27:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:52,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 08:27:52,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:52,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 08:27:52,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-28 08:27:52,955 INFO L87 Difference]: Start difference. First operand 367 states and 495 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:53,062 INFO L93 Difference]: Finished difference Result 368 states and 496 transitions. [2021-12-28 08:27:53,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 08:27:53,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 58 [2021-12-28 08:27:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:53,064 INFO L225 Difference]: With dead ends: 368 [2021-12-28 08:27:53,064 INFO L226 Difference]: Without dead ends: 368 [2021-12-28 08:27:53,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-28 08:27:53,065 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:53,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1445 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 305 Unchecked, 0.0s Time] [2021-12-28 08:27:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-12-28 08:27:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2021-12-28 08:27:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 284 states have (on average 1.7253521126760563) internal successors, (490), 363 states have internal predecessors, (490), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 08:27:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 496 transitions. [2021-12-28 08:27:53,071 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 496 transitions. Word has length 58 [2021-12-28 08:27:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:53,071 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 496 transitions. [2021-12-28 08:27:53,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 496 transitions. [2021-12-28 08:27:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-28 08:27:53,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:53,072 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:53,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:53,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:53,288 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:53,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash -317642580, now seen corresponding path program 1 times [2021-12-28 08:27:53,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:53,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744510533] [2021-12-28 08:27:53,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:53,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:53,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:53,290 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:53,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-28 08:27:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:53,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 08:27:53,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:27:53,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:53,681 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:53,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744510533] [2021-12-28 08:27:53,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744510533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:53,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:53,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 08:27:53,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504931635] [2021-12-28 08:27:53,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:53,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 08:27:53,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 08:27:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 08:27:53,683 INFO L87 Difference]: Start difference. First operand 368 states and 496 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:53,924 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2021-12-28 08:27:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 08:27:53,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 59 [2021-12-28 08:27:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:53,926 INFO L225 Difference]: With dead ends: 286 [2021-12-28 08:27:53,926 INFO L226 Difference]: Without dead ends: 286 [2021-12-28 08:27:53,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 08:27:53,927 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 263 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:53,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 954 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 08:27:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-12-28 08:27:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 264. [2021-12-28 08:27:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 260 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 297 transitions. [2021-12-28 08:27:53,931 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 297 transitions. Word has length 59 [2021-12-28 08:27:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:53,931 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 297 transitions. [2021-12-28 08:27:53,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 297 transitions. [2021-12-28 08:27:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-28 08:27:53,932 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:53,932 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:53,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:54,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:54,135 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:54,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1256967413, now seen corresponding path program 1 times [2021-12-28 08:27:54,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:54,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707973135] [2021-12-28 08:27:54,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:54,137 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:54,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:54,138 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:54,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-28 08:27:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:54,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 08:27:54,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:27:54,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:54,473 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707973135] [2021-12-28 08:27:54,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707973135] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:54,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:54,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 08:27:54,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319545220] [2021-12-28 08:27:54,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:54,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 08:27:54,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:54,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 08:27:54,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 08:27:54,474 INFO L87 Difference]: Start difference. First operand 264 states and 297 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:55,165 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2021-12-28 08:27:55,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 08:27:55,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 60 [2021-12-28 08:27:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:55,175 INFO L225 Difference]: With dead ends: 282 [2021-12-28 08:27:55,175 INFO L226 Difference]: Without dead ends: 282 [2021-12-28 08:27:55,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 08:27:55,176 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 277 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:55,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 631 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-28 08:27:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-28 08:27:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2021-12-28 08:27:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 193 states have (on average 1.61139896373057) internal successors, (311), 271 states have internal predecessors, (311), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 315 transitions. [2021-12-28 08:27:55,180 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 315 transitions. Word has length 60 [2021-12-28 08:27:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:55,181 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 315 transitions. [2021-12-28 08:27:55,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 315 transitions. [2021-12-28 08:27:55,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-28 08:27:55,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:55,182 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:55,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:55,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:55,393 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:55,394 INFO L85 PathProgramCache]: Analyzing trace with hash -311284142, now seen corresponding path program 1 times [2021-12-28 08:27:55,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:55,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868616044] [2021-12-28 08:27:55,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:55,395 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:55,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:55,396 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:55,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-28 08:27:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:55,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 08:27:55,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:55,928 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-28 08:27:55,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-28 08:27:55,949 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-28 08:27:55,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2021-12-28 08:27:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:27:55,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:55,975 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:55,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868616044] [2021-12-28 08:27:55,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868616044] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:55,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:55,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 08:27:55,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987476965] [2021-12-28 08:27:55,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:55,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:27:55,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:27:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:27:55,977 INFO L87 Difference]: Start difference. First operand 275 states and 315 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:56,377 INFO L93 Difference]: Finished difference Result 282 states and 322 transitions. [2021-12-28 08:27:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:27:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 61 [2021-12-28 08:27:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:56,379 INFO L225 Difference]: With dead ends: 282 [2021-12-28 08:27:56,379 INFO L226 Difference]: Without dead ends: 282 [2021-12-28 08:27:56,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:27:56,380 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 214 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:56,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 373 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 08:27:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-28 08:27:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2021-12-28 08:27:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.606060606060606) internal successors, (318), 275 states have internal predecessors, (318), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2021-12-28 08:27:56,384 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 61 [2021-12-28 08:27:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:56,385 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2021-12-28 08:27:56,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2021-12-28 08:27:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-28 08:27:56,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:56,386 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:56,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:56,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:56,600 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash -311284141, now seen corresponding path program 1 times [2021-12-28 08:27:56,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:56,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168710326] [2021-12-28 08:27:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:56,601 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:56,603 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:56,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-28 08:27:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:57,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-28 08:27:57,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:57,197 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-28 08:27:57,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-28 08:27:57,231 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-28 08:27:57,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-28 08:27:57,425 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 08:27:57,426 INFO L387 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 [2021-12-28 08:27:57,438 INFO L387 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 17 treesize of output 19 [2021-12-28 08:27:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:27:57,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:57,618 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:57,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168710326] [2021-12-28 08:27:57,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168710326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:57,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:57,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 08:27:57,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572278221] [2021-12-28 08:27:57,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:57,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 08:27:57,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:57,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 08:27:57,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-28 08:27:57,619 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:57,729 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2021-12-28 08:27:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 08:27:57,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 61 [2021-12-28 08:27:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:57,730 INFO L225 Difference]: With dead ends: 279 [2021-12-28 08:27:57,730 INFO L226 Difference]: Without dead ends: 279 [2021-12-28 08:27:57,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-28 08:27:57,731 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 4 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:57,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1427 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 303 Unchecked, 0.0s Time] [2021-12-28 08:27:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-28 08:27:57,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2021-12-28 08:27:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.601010101010101) internal successors, (317), 275 states have internal predecessors, (317), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 321 transitions. [2021-12-28 08:27:57,736 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 321 transitions. Word has length 61 [2021-12-28 08:27:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:57,736 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 321 transitions. [2021-12-28 08:27:57,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 321 transitions. [2021-12-28 08:27:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-28 08:27:57,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:57,737 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2021-12-28 08:27:57,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-28 08:27:57,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:57,947 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:57,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash -631451440, now seen corresponding path program 1 times [2021-12-28 08:27:57,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:57,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745413062] [2021-12-28 08:27:57,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:57,949 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:57,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:57,950 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:57,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-28 08:27:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:58,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 08:27:58,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:58,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 08:27:58,521 INFO L387 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 16 treesize of output 12 [2021-12-28 08:27:58,617 INFO L353 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2021-12-28 08:27:58,617 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-12-28 08:27:58,682 INFO L387 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 26 treesize of output 12 [2021-12-28 08:27:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:27:58,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:58,693 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:58,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745413062] [2021-12-28 08:27:58,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745413062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:58,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:58,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 08:27:58,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710783374] [2021-12-28 08:27:58,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:58,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 08:27:58,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:58,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 08:27:58,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-28 08:27:58,696 INFO L87 Difference]: Start difference. First operand 279 states and 321 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:59,672 INFO L93 Difference]: Finished difference Result 277 states and 317 transitions. [2021-12-28 08:27:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 08:27:59,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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 64 [2021-12-28 08:27:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:59,674 INFO L225 Difference]: With dead ends: 277 [2021-12-28 08:27:59,674 INFO L226 Difference]: Without dead ends: 277 [2021-12-28 08:27:59,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-28 08:27:59,674 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 232 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:59,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1042 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-28 08:27:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-28 08:27:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2021-12-28 08:27:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 273 states have internal predecessors, (313), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:27:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 317 transitions. [2021-12-28 08:27:59,678 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 317 transitions. Word has length 64 [2021-12-28 08:27:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:59,679 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 317 transitions. [2021-12-28 08:27:59,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:27:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 317 transitions. [2021-12-28 08:27:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-28 08:27:59,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:59,679 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2021-12-28 08:27:59,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:59,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:27:59,891 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:27:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash -631451439, now seen corresponding path program 1 times [2021-12-28 08:27:59,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:59,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602896082] [2021-12-28 08:27:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:59,893 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:59,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:59,894 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:27:59,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-28 08:28:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:28:00,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 08:28:00,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:28:00,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-28 08:28:00,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 08:28:00,515 INFO L387 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 16 treesize of output 12 [2021-12-28 08:28:00,526 INFO L387 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 16 treesize of output 12 [2021-12-28 08:28:00,596 INFO L387 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 21 treesize of output 23 [2021-12-28 08:28:00,608 INFO L387 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 19 treesize of output 21 [2021-12-28 08:28:00,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2021-12-28 08:28:00,659 INFO L387 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 27 treesize of output 9 [2021-12-28 08:28:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:28:00,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:28:00,676 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:28:00,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602896082] [2021-12-28 08:28:00,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602896082] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:28:00,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:28:00,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 08:28:00,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865627163] [2021-12-28 08:28:00,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:28:00,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 08:28:00,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:28:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 08:28:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 08:28:00,677 INFO L87 Difference]: Start difference. First operand 277 states and 317 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:28:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:28:01,802 INFO L93 Difference]: Finished difference Result 276 states and 315 transitions. [2021-12-28 08:28:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 08:28:01,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 64 [2021-12-28 08:28:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:28:01,804 INFO L225 Difference]: With dead ends: 276 [2021-12-28 08:28:01,804 INFO L226 Difference]: Without dead ends: 276 [2021-12-28 08:28:01,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-28 08:28:01,804 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 240 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:28:01,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 734 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-28 08:28:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-12-28 08:28:01,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2021-12-28 08:28:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 198 states have (on average 1.5707070707070707) internal successors, (311), 272 states have internal predecessors, (311), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:28:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 315 transitions. [2021-12-28 08:28:01,808 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 315 transitions. Word has length 64 [2021-12-28 08:28:01,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:28:01,808 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 315 transitions. [2021-12-28 08:28:01,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:28:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 315 transitions. [2021-12-28 08:28:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-28 08:28:01,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:28:01,809 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2021-12-28 08:28:01,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-28 08:28:02,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:28:02,010 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:28:02,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:28:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash -889593477, now seen corresponding path program 1 times [2021-12-28 08:28:02,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:28:02,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736940425] [2021-12-28 08:28:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:28:02,011 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:28:02,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:28:02,012 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:28:02,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-28 08:28:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:28:02,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 08:28:02,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:28:02,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-28 08:28:02,731 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 08:28:02,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2021-12-28 08:28:02,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-28 08:28:02,834 INFO L387 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 34 treesize of output 34 [2021-12-28 08:28:02,941 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:28:02,941 INFO L387 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 43 treesize of output 44 [2021-12-28 08:28:02,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2021-12-28 08:28:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:28:03,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:28:03,062 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:28:03,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736940425] [2021-12-28 08:28:03,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736940425] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:28:03,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:28:03,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 08:28:03,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455183054] [2021-12-28 08:28:03,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:28:03,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 08:28:03,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:28:03,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 08:28:03,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-28 08:28:03,063 INFO L87 Difference]: Start difference. First operand 276 states and 315 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:28:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:28:03,978 INFO L93 Difference]: Finished difference Result 297 states and 337 transitions. [2021-12-28 08:28:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 08:28:03,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-12-28 08:28:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:28:03,979 INFO L225 Difference]: With dead ends: 297 [2021-12-28 08:28:03,980 INFO L226 Difference]: Without dead ends: 297 [2021-12-28 08:28:03,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-28 08:28:03,980 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 493 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-28 08:28:03,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 649 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 282 Invalid, 0 Unknown, 107 Unchecked, 0.8s Time] [2021-12-28 08:28:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-12-28 08:28:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2021-12-28 08:28:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5748792270531402) internal successors, (326), 281 states have internal predecessors, (326), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:28:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 330 transitions. [2021-12-28 08:28:03,984 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 330 transitions. Word has length 68 [2021-12-28 08:28:03,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:28:03,984 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 330 transitions. [2021-12-28 08:28:03,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:28:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 330 transitions. [2021-12-28 08:28:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-28 08:28:03,984 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:28:03,984 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2021-12-28 08:28:04,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-28 08:28:04,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:28:04,185 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:28:04,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:28:04,185 INFO L85 PathProgramCache]: Analyzing trace with hash -889593476, now seen corresponding path program 1 times [2021-12-28 08:28:04,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:28:04,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273819924] [2021-12-28 08:28:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:28:04,186 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:28:04,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:28:04,187 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:28:04,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-28 08:28:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:28:04,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 08:28:04,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:28:04,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-28 08:28:04,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 08:28:04,882 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 08:28:04,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2021-12-28 08:28:04,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-28 08:28:04,925 INFO L387 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 16 treesize of output 12 [2021-12-28 08:28:05,011 INFO L387 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 34 treesize of output 34 [2021-12-28 08:28:05,019 INFO L387 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 19 treesize of output 21 [2021-12-28 08:28:05,142 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:28:05,142 INFO L387 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 58 treesize of output 57 [2021-12-28 08:28:05,148 INFO L387 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 28 treesize of output 30 [2021-12-28 08:28:05,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2021-12-28 08:28:05,242 INFO L387 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 25 treesize of output 7 [2021-12-28 08:28:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 08:28:05,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:28:05,264 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:28:05,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273819924] [2021-12-28 08:28:05,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273819924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:28:05,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:28:05,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 08:28:05,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053337179] [2021-12-28 08:28:05,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:28:05,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 08:28:05,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:28:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 08:28:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-28 08:28:05,265 INFO L87 Difference]: Start difference. First operand 285 states and 330 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:28:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:28:07,079 INFO L93 Difference]: Finished difference Result 297 states and 334 transitions. [2021-12-28 08:28:07,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 08:28:07,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-12-28 08:28:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:28:07,081 INFO L225 Difference]: With dead ends: 297 [2021-12-28 08:28:07,081 INFO L226 Difference]: Without dead ends: 297 [2021-12-28 08:28:07,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-28 08:28:07,082 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 482 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-28 08:28:07,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 669 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-28 08:28:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-12-28 08:28:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2021-12-28 08:28:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5555555555555556) internal successors, (322), 281 states have internal predecessors, (322), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:28:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 326 transitions. [2021-12-28 08:28:07,086 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 326 transitions. Word has length 68 [2021-12-28 08:28:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:28:07,086 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 326 transitions. [2021-12-28 08:28:07,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:28:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 326 transitions. [2021-12-28 08:28:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-28 08:28:07,087 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:28:07,087 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:28:07,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-28 08:28:07,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:28:07,302 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:28:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:28:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash -269261804, now seen corresponding path program 1 times [2021-12-28 08:28:07,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:28:07,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14197327] [2021-12-28 08:28:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:28:07,303 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:28:07,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:28:07,304 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:28:07,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-28 08:28:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:28:08,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 08:28:08,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:28:08,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-28 08:28:08,175 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 08:28:08,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2021-12-28 08:28:08,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-28 08:28:08,276 INFO L387 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 34 treesize of output 34 [2021-12-28 08:28:08,385 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:28:08,385 INFO L387 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 43 treesize of output 44 [2021-12-28 08:28:08,484 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:28:08,484 INFO L387 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 43 treesize of output 44 [2021-12-28 08:28:08,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2021-12-28 08:28:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2021-12-28 08:28:08,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:28:08,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1548) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2021-12-28 08:28:08,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2021-12-28 08:28:08,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2021-12-28 08:28:08,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1546 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1546))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1547)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))) is different from false [2021-12-28 08:28:08,942 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 08:28:08,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 76 [2021-12-28 08:28:08,948 INFO L387 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 2665 treesize of output 1963 [2021-12-28 08:28:08,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1959 treesize of output 1644 [2021-12-28 08:28:08,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1644 treesize of output 1294 [2021-12-28 08:28:08,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1294 treesize of output 1266 [2021-12-28 08:28:15,948 INFO L353 Elim1Store]: treesize reduction -11, result has 113.6 percent of original size [2021-12-28 08:28:15,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 142 treesize of output 219 [2021-12-28 08:28:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2021-12-28 08:28:17,063 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:28:17,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14197327] [2021-12-28 08:28:17,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14197327] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:28:17,063 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 08:28:17,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2021-12-28 08:28:17,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430947686] [2021-12-28 08:28:17,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 08:28:17,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-28 08:28:17,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:28:17,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-28 08:28:17,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=163, Unknown=8, NotChecked=116, Total=342 [2021-12-28 08:28:17,065 INFO L87 Difference]: Start difference. First operand 285 states and 326 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:28:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:28:18,816 INFO L93 Difference]: Finished difference Result 287 states and 326 transitions. [2021-12-28 08:28:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 08:28:18,816 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 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 73 [2021-12-28 08:28:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:28:18,817 INFO L225 Difference]: With dead ends: 287 [2021-12-28 08:28:18,817 INFO L226 Difference]: Without dead ends: 287 [2021-12-28 08:28:18,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=206, Unknown=8, NotChecked=132, Total=420 [2021-12-28 08:28:18,818 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 20 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 802 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 08:28:18,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 2318 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 306 Invalid, 0 Unknown, 802 Unchecked, 1.2s Time] [2021-12-28 08:28:18,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-28 08:28:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2021-12-28 08:28:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5507246376811594) internal successors, (321), 281 states have internal predecessors, (321), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 08:28:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 325 transitions. [2021-12-28 08:28:18,822 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 325 transitions. Word has length 73 [2021-12-28 08:28:18,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:28:18,822 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 325 transitions. [2021-12-28 08:28:18,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 08:28:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 325 transitions. [2021-12-28 08:28:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-28 08:28:18,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:28:18,823 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:28:18,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-28 08:28:19,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:28:19,039 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-28 08:28:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:28:19,039 INFO L85 PathProgramCache]: Analyzing trace with hash -269261803, now seen corresponding path program 1 times [2021-12-28 08:28:19,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:28:19,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320396629] [2021-12-28 08:28:19,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:28:19,040 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:28:19,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:28:19,041 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 08:28:19,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-28 08:28:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:28:19,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-28 08:28:19,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:28:19,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-28 08:28:19,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 08:28:19,894 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 08:28:19,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2021-12-28 08:28:19,920 INFO L387 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 16 treesize of output 12 [2021-12-28 08:28:19,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-28 08:28:20,026 INFO L387 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 34 treesize of output 34 [2021-12-28 08:28:20,033 INFO L387 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 19 treesize of output 21 [2021-12-28 08:28:20,166 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:28:20,166 INFO L387 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 58 treesize of output 57 [2021-12-28 08:28:20,173 INFO L387 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 28 treesize of output 30 [2021-12-28 08:28:20,352 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:28:20,352 INFO L387 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 58 treesize of output 57 [2021-12-28 08:28:20,359 INFO L387 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 28 treesize of output 30 [2021-12-28 08:28:20,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2021-12-28 08:28:20,492 INFO L387 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 25 treesize of output 7 [2021-12-28 08:28:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-28 08:28:20,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:28:21,722 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse1 .cse2) (bvadd (_ bv1 64) .cse1 .cse2))))) is different from false [2021-12-28 08:28:21,816 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (.cse3 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse2 .cse3) (bvadd (_ bv1 64) .cse2 .cse3))))) is different from false [2021-12-28 08:28:21,953 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 ((_ sign_extend 32) (_ bv1 32))) (.cse3 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse2 .cse3) (bvadd .cse2 (_ bv1 64) .cse3))))) is different from false [2021-12-28 08:28:22,045 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1678)) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1679) .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (.cse4 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv1 64)))))) is different from false [2021-12-28 08:28:22,338 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1678))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1679) .cse1 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1680)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse5 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv1 64)))))) is different from false [2021-12-28 08:28:22,529 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1677 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1676))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1677) .cse2 v_ArrVal_1679) (select (select (store .cse3 .cse2 v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1677 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1676)) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1678))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1677) .cse5 v_ArrVal_1679) .cse6 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) (_ bv1 64)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))) is different from false [2021-12-28 08:28:22,611 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 08:28:22,611 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2021-12-28 08:28:22,629 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 08:28:22,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2021-12-28 08:28:22,642 INFO L387 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 5607 treesize of output 4554 [2021-12-28 08:28:22,681 INFO L387 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 92771 treesize of output 89882 [2021-12-28 08:28:23,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89878 treesize of output 81366 [2021-12-28 08:28:23,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81366 treesize of output 79126 [2021-12-28 08:28:23,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79126 treesize of output 75094 [2021-12-28 08:28:23,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75094 treesize of output 64426 [2021-12-28 08:28:23,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64426 treesize of output 55914 [2021-12-28 08:28:23,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55914 treesize of output 46842 [2021-12-28 08:28:25,968 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:28:25,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320396629] [2021-12-28 08:28:25,968 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2021-12-28 08:28:25,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-28 08:28:26,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 08:28:26,188 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-28 08:28:26,192 INFO L158 Benchmark]: Toolchain (without parser) took 51142.31ms. Allocated memory was 56.6MB in the beginning and 478.2MB in the end (delta: 421.5MB). Free memory was 33.3MB in the beginning and 163.0MB in the end (delta: -129.6MB). Peak memory consumption was 296.9MB. Max. memory is 16.1GB. [2021-12-28 08:28:26,192 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 56.6MB. Free memory is still 39.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 08:28:26,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.06ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 33.2MB in the beginning and 39.6MB in the end (delta: -6.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2021-12-28 08:28:26,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.14ms. Allocated memory is still 73.4MB. Free memory was 39.6MB in the beginning and 35.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 08:28:26,193 INFO L158 Benchmark]: Boogie Preprocessor took 58.15ms. Allocated memory is still 73.4MB. Free memory was 35.1MB in the beginning and 47.4MB in the end (delta: -12.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2021-12-28 08:28:26,194 INFO L158 Benchmark]: RCFGBuilder took 1336.02ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 47.0MB in the beginning and 65.5MB in the end (delta: -18.5MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2021-12-28 08:28:26,194 INFO L158 Benchmark]: TraceAbstraction took 48974.03ms. Allocated memory was 94.4MB in the beginning and 478.2MB in the end (delta: 383.8MB). Free memory was 65.0MB in the beginning and 163.0MB in the end (delta: -97.9MB). Peak memory consumption was 291.6MB. Max. memory is 16.1GB. [2021-12-28 08:28:26,195 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.47ms. Allocated memory is still 56.6MB. Free memory is still 39.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.06ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 33.2MB in the beginning and 39.6MB in the end (delta: -6.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.14ms. Allocated memory is still 73.4MB. Free memory was 39.6MB in the beginning and 35.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.15ms. Allocated memory is still 73.4MB. Free memory was 35.1MB in the beginning and 47.4MB in the end (delta: -12.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1336.02ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 47.0MB in the beginning and 65.5MB in the end (delta: -18.5MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 48974.03ms. Allocated memory was 94.4MB in the beginning and 478.2MB in the end (delta: 383.8MB). Free memory was 65.0MB in the beginning and 163.0MB in the end (delta: -97.9MB). Peak memory consumption was 291.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-28 08:28:26,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range