./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-1.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-1.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 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 08:27:24,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 08:27:24,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 08:27:24,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 08:27:24,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 08:27:24,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 08:27:24,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 08:27:24,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 08:27:24,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 08:27:24,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 08:27:24,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 08:27:24,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 08:27:24,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 08:27:24,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 08:27:24,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 08:27:24,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 08:27:24,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 08:27:24,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 08:27:24,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 08:27:24,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 08:27:24,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 08:27:24,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 08:27:24,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 08:27:24,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 08:27:24,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 08:27:24,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 08:27:24,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 08:27:24,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 08:27:24,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 08:27:24,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 08:27:24,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 08:27:24,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 08:27:24,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 08:27:24,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 08:27:24,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 08:27:24,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 08:27:24,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 08:27:24,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 08:27:24,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 08:27:24,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 08:27:24,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 08:27:24,587 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:24,615 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 08:27:24,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 08:27:24,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 08:27:24,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 08:27:24,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 08:27:24,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 08:27:24,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 08:27:24,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 08:27:24,618 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 08:27:24,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 08:27:24,619 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 08:27:24,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 08:27:24,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 08:27:24,619 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 08:27:24,620 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 08:27:24,620 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 08:27:24,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 08:27:24,620 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 08:27:24,620 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 08:27:24,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 08:27:24,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 08:27:24,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 08:27:24,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 08:27:24,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 08:27:24,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 08:27:24,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 08:27:24,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 08:27:24,622 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 -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2021-12-28 08:27:24,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 08:27:24,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 08:27:24,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 08:27:24,930 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 08:27:24,944 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 08:27:24,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2021-12-28 08:27:25,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ea8772c7/f3ca8b37fb2b4732a462df6b1217488d/FLAG2384253dd [2021-12-28 08:27:25,545 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 08:27:25,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2021-12-28 08:27:25,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ea8772c7/f3ca8b37fb2b4732a462df6b1217488d/FLAG2384253dd [2021-12-28 08:27:26,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ea8772c7/f3ca8b37fb2b4732a462df6b1217488d [2021-12-28 08:27:26,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 08:27:26,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 08:27:26,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 08:27:26,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 08:27:26,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 08:27:26,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 08:27:26" (1/1) ... [2021-12-28 08:27:26,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50574bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:26, skipping insertion in model container [2021-12-28 08:27:26,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 08:27:26" (1/1) ... [2021-12-28 08:27:26,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 08:27:26,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 08:27:26,557 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-1.i[58057,58070] [2021-12-28 08:27:26,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 08:27:26,623 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:26,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@263b6012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:26, skipping insertion in model container [2021-12-28 08:27:26,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 08:27:26,624 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-28 08:27:26,626 INFO L158 Benchmark]: Toolchain (without parser) took 570.10ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 24.4MB in the beginning and 41.5MB in the end (delta: -17.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2021-12-28 08:27:26,627 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 34.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 08:27:26,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.99ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 24.2MB in the beginning and 41.5MB in the end (delta: -17.3MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2021-12-28 08:27:26,630 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 34.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.99ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 24.2MB in the beginning and 41.5MB in the end (delta: -17.3MB). Peak memory consumption was 6.0MB. 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-1.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 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 08:27:28,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 08:27:28,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 08:27:28,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 08:27:28,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 08:27:28,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 08:27:28,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 08:27:28,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 08:27:28,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 08:27:28,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 08:27:28,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 08:27:28,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 08:27:28,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 08:27:28,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 08:27:28,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 08:27:28,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 08:27:28,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 08:27:28,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 08:27:28,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 08:27:28,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 08:27:28,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 08:27:28,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 08:27:28,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 08:27:28,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 08:27:28,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 08:27:28,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 08:27:28,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 08:27:28,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 08:27:28,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 08:27:28,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 08:27:28,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 08:27:28,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 08:27:28,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 08:27:28,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 08:27:28,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 08:27:28,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 08:27:28,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 08:27:28,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 08:27:28,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 08:27:28,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 08:27:28,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 08:27:28,108 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:28,134 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 08:27:28,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 08:27:28,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 08:27:28,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 08:27:28,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 08:27:28,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 08:27:28,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 08:27:28,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 08:27:28,137 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 08:27:28,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 08:27:28,137 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 08:27:28,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 08:27:28,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 08:27:28,138 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 08:27:28,138 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 08:27:28,138 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 08:27:28,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 08:27:28,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 08:27:28,138 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-28 08:27:28,139 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-28 08:27:28,139 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 08:27:28,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 08:27:28,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 08:27:28,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 08:27:28,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 08:27:28,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 08:27:28,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 08:27:28,147 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-28 08:27:28,147 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-28 08:27:28,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-28 08:27:28,148 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 -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2021-12-28 08:27:28,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 08:27:28,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 08:27:28,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 08:27:28,397 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 08:27:28,397 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 08:27:28,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2021-12-28 08:27:28,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e66c58157/17118ea5975e4e9cb5f7dfbcbde8bdce/FLAGf5b075193 [2021-12-28 08:27:28,913 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 08:27:28,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2021-12-28 08:27:28,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e66c58157/17118ea5975e4e9cb5f7dfbcbde8bdce/FLAGf5b075193 [2021-12-28 08:27:28,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e66c58157/17118ea5975e4e9cb5f7dfbcbde8bdce [2021-12-28 08:27:28,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 08:27:28,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 08:27:28,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 08:27:28,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 08:27:28,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 08:27:28,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 08:27:28" (1/1) ... [2021-12-28 08:27:28,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436ee4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:28, skipping insertion in model container [2021-12-28 08:27:28,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 08:27:28" (1/1) ... [2021-12-28 08:27:28,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 08:27:29,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 08:27:29,520 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-1.i[58057,58070] [2021-12-28 08:27:29,579 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 08:27:29,592 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-28 08:27:29,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 08:27:29,630 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-1.i[58057,58070] [2021-12-28 08:27:29,654 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 08:27:29,673 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 08:27:29,731 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-1.i[58057,58070] [2021-12-28 08:27:29,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 08:27:29,831 INFO L208 MainTranslator]: Completed translation [2021-12-28 08:27:29,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:29 WrapperNode [2021-12-28 08:27:29,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 08:27:29,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 08:27:29,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 08:27:29,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 08:27:29,837 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:29" (1/1) ... [2021-12-28 08:27:29,869 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:29" (1/1) ... [2021-12-28 08:27:29,915 INFO L137 Inliner]: procedures = 352, calls = 112, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 383 [2021-12-28 08:27:29,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 08:27:29,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 08:27:29,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 08:27:29,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 08:27:29,924 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:29" (1/1) ... [2021-12-28 08:27:29,924 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:29" (1/1) ... [2021-12-28 08:27:29,941 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:29" (1/1) ... [2021-12-28 08:27:29,951 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:29" (1/1) ... [2021-12-28 08:27:29,977 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:29" (1/1) ... [2021-12-28 08:27:29,981 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:29" (1/1) ... [2021-12-28 08:27:29,985 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:29" (1/1) ... [2021-12-28 08:27:29,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 08:27:30,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 08:27:30,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 08:27:30,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 08:27:30,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:29" (1/1) ... [2021-12-28 08:27:30,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 08:27:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 08:27:30,044 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:30,069 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:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-28 08:27:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-28 08:27:30,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 08:27:30,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 08:27:30,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 08:27:30,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-12-28 08:27:30,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 08:27:30,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-28 08:27:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 08:27:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2021-12-28 08:27:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 08:27:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 08:27:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 08:27:30,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 08:27:30,308 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 08:27:30,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 08:27:31,041 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 08:27:31,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 08:27:31,046 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-28 08:27:31,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 08:27:31 BoogieIcfgContainer [2021-12-28 08:27:31,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 08:27:31,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 08:27:31,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 08:27:31,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 08:27:31,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 08:27:28" (1/3) ... [2021-12-28 08:27:31,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3ed506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 08:27:31, skipping insertion in model container [2021-12-28 08:27:31,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 08:27:29" (2/3) ... [2021-12-28 08:27:31,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3ed506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 08:27:31, skipping insertion in model container [2021-12-28 08:27:31,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 08:27:31" (3/3) ... [2021-12-28 08:27:31,052 INFO L111 eAbstractionObserver]: Analyzing ICFG basename-1.i [2021-12-28 08:27:31,055 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 08:27:31,055 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2021-12-28 08:27:31,099 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 08:27:31,104 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:31,104 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2021-12-28 08:27:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 147 states have (on average 1.9319727891156462) internal successors, (284), 239 states have internal predecessors, (284), 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:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 08:27:31,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:31,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 08:27:31,132 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:31,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-28 08:27:31,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:31,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247695744] [2021-12-28 08:27:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:31,146 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:31,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:31,160 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:31,161 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:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:31,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 08:27:31,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:31,344 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:31,350 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:31,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:31,350 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:31,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247695744] [2021-12-28 08:27:31,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247695744] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:31,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:31,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 08:27:31,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455442175] [2021-12-28 08:27:31,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:31,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:27:31,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:31,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:27:31,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:31,382 INFO L87 Difference]: Start difference. First operand has 243 states, 147 states have (on average 1.9319727891156462) internal successors, (284), 239 states have internal predecessors, (284), 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:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:31,749 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2021-12-28 08:27:31,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:27:31,752 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:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:31,759 INFO L225 Difference]: With dead ends: 251 [2021-12-28 08:27:31,761 INFO L226 Difference]: Without dead ends: 249 [2021-12-28 08:27:31,763 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:31,767 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 239 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:31,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 207 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 08:27:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-12-28 08:27:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2021-12-28 08:27:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 142 states have (on average 1.8450704225352113) internal successors, (262), 229 states have internal predecessors, (262), 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:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 266 transitions. [2021-12-28 08:27:31,821 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 266 transitions. Word has length 3 [2021-12-28 08:27:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:31,822 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 266 transitions. [2021-12-28 08:27:31,822 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:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 266 transitions. [2021-12-28 08:27:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 08:27:31,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:31,822 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 08:27:31,831 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:32,031 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:32,031 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:32,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:32,032 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-28 08:27:32,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:32,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392057660] [2021-12-28 08:27:32,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:32,033 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:32,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:32,034 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:32,036 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:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:32,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 08:27:32,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:32,151 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:32,158 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:32,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:32,159 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:32,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392057660] [2021-12-28 08:27:32,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392057660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:32,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:32,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 08:27:32,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199088851] [2021-12-28 08:27:32,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:32,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:27:32,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:32,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:27:32,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:32,164 INFO L87 Difference]: Start difference. First operand 233 states and 266 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:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:32,636 INFO L93 Difference]: Finished difference Result 232 states and 265 transitions. [2021-12-28 08:27:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:27:32,638 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:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:32,639 INFO L225 Difference]: With dead ends: 232 [2021-12-28 08:27:32,639 INFO L226 Difference]: Without dead ends: 232 [2021-12-28 08:27:32,639 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:32,640 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 9 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:32,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 432 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 08:27:32,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-28 08:27:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2021-12-28 08:27:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 228 states have internal predecessors, (261), 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:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 265 transitions. [2021-12-28 08:27:32,647 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 265 transitions. Word has length 3 [2021-12-28 08:27:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:32,647 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 265 transitions. [2021-12-28 08:27:32,648 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:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 265 transitions. [2021-12-28 08:27:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 08:27:32,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:32,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 08:27:32,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-28 08:27:32,857 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:32,857 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:32,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:32,858 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2021-12-28 08:27:32,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:32,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882023709] [2021-12-28 08:27:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:32,859 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:32,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:32,877 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:32,879 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:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:33,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 08:27:33,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:33,027 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:33,082 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:33,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:33,082 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:33,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882023709] [2021-12-28 08:27:33,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882023709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:33,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:33,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 08:27:33,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387304923] [2021-12-28 08:27:33,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:33,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:27:33,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:33,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:27:33,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:27:33,085 INFO L87 Difference]: Start difference. First operand 232 states and 265 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:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:33,559 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2021-12-28 08:27:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:27:33,559 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:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:33,560 INFO L225 Difference]: With dead ends: 236 [2021-12-28 08:27:33,560 INFO L226 Difference]: Without dead ends: 236 [2021-12-28 08:27:33,561 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:33,561 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 13 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:33,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 431 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 08:27:33,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-28 08:27:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2021-12-28 08:27:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 144 states have (on average 1.8263888888888888) 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:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2021-12-28 08:27:33,568 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 6 [2021-12-28 08:27:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:33,568 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2021-12-28 08:27:33,568 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:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2021-12-28 08:27:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 08:27:33,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:33,574 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:33,583 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:33,781 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:33,781 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:33,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2021-12-28 08:27:33,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:33,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774905745] [2021-12-28 08:27:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:33,782 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:33,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:33,783 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:33,785 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:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:33,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 08:27:33,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:33,964 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:34,065 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:34,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:27:34,960 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:34,960 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:34,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774905745] [2021-12-28 08:27:34,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774905745] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:27:34,961 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 08:27:34,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-28 08:27:34,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605039982] [2021-12-28 08:27:34,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 08:27:34,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 08:27:34,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 08:27:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-28 08:27:34,962 INFO L87 Difference]: Start difference. First operand 234 states and 267 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:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:38,075 INFO L93 Difference]: Finished difference Result 240 states and 273 transitions. [2021-12-28 08:27:38,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 08:27:38,077 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:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:38,078 INFO L225 Difference]: With dead ends: 240 [2021-12-28 08:27:38,078 INFO L226 Difference]: Without dead ends: 240 [2021-12-28 08:27:38,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-28 08:27:38,079 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 19 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:38,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1120 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-12-28 08:27:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-12-28 08:27:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-12-28 08:27:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 151 states have (on average 1.781456953642384) internal successors, (269), 236 states have internal predecessors, (269), 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,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 273 transitions. [2021-12-28 08:27:38,084 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 273 transitions. Word has length 10 [2021-12-28 08:27:38,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:38,084 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 273 transitions. [2021-12-28 08:27:38,084 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:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2021-12-28 08:27:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 08:27:38,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:38,085 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:38,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:38,285 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:38,286 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:38,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash -955562967, now seen corresponding path program 1 times [2021-12-28 08:27:38,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:38,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549296436] [2021-12-28 08:27:38,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:38,291 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:38,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:38,295 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:38,308 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:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:38,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 08:27:38,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:38,507 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:38,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:27:38,623 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:38,623 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:38,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549296436] [2021-12-28 08:27:38,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549296436] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:27:38,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 08:27:38,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-28 08:27:38,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386176389] [2021-12-28 08:27:38,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 08:27:38,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 08:27:38,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:38,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 08:27:38,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 08:27:38,628 INFO L87 Difference]: Start difference. First operand 240 states and 273 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 08:27:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:38,811 INFO L93 Difference]: Finished difference Result 260 states and 293 transitions. [2021-12-28 08:27:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 08:27:38,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-12-28 08:27:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:38,825 INFO L225 Difference]: With dead ends: 260 [2021-12-28 08:27:38,825 INFO L226 Difference]: Without dead ends: 260 [2021-12-28 08:27:38,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 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:38,827 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 24 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:38,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 1564 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 08:27:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-28 08:27:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2021-12-28 08:27:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 171 states have (on average 1.6900584795321638) internal successors, (289), 256 states have internal predecessors, (289), 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,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 293 transitions. [2021-12-28 08:27:38,837 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 293 transitions. Word has length 25 [2021-12-28 08:27:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:38,837 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 293 transitions. [2021-12-28 08:27:38,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 08:27:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 293 transitions. [2021-12-28 08:27:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 08:27:38,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:38,838 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:38,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-28 08:27:39,047 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:39,048 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:39,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:39,048 INFO L85 PathProgramCache]: Analyzing trace with hash -167681350, now seen corresponding path program 2 times [2021-12-28 08:27:39,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:39,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589861498] [2021-12-28 08:27:39,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 08:27:39,049 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:39,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:39,051 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:39,051 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:39,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 08:27:39,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 08:27:39,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 08:27:39,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:39,240 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-28 08:27:39,241 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:39,301 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:39,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:39,302 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:39,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589861498] [2021-12-28 08:27:39,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589861498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:39,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:39,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 08:27:39,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877897946] [2021-12-28 08:27:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:39,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 08:27:39,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 08:27:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 08:27:39,307 INFO L87 Difference]: Start difference. First operand 260 states and 293 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:39,626 INFO L93 Difference]: Finished difference Result 271 states and 305 transitions. [2021-12-28 08:27:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 08:27:39,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 45 [2021-12-28 08:27:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:39,628 INFO L225 Difference]: With dead ends: 271 [2021-12-28 08:27:39,628 INFO L226 Difference]: Without dead ends: 271 [2021-12-28 08:27:39,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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:39,629 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 224 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:39,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 210 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 08:27:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-28 08:27:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2021-12-28 08:27:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 171 states have (on average 1.6608187134502923) internal successors, (284), 251 states have internal predecessors, (284), 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,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2021-12-28 08:27:39,632 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 45 [2021-12-28 08:27:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:39,633 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2021-12-28 08:27:39,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2021-12-28 08:27:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 08:27:39,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:39,635 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:39,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:39,835 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:39,835 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:39,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:39,836 INFO L85 PathProgramCache]: Analyzing trace with hash -167681349, now seen corresponding path program 1 times [2021-12-28 08:27:39,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:39,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075055482] [2021-12-28 08:27:39,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:39,837 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:39,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:39,844 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:39,845 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:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:40,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 08:27:40,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:40,143 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:40,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:27:40,373 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:40,374 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:40,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075055482] [2021-12-28 08:27:40,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075055482] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:27:40,374 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 08:27:40,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-12-28 08:27:40,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667067626] [2021-12-28 08:27:40,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 08:27:40,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-28 08:27:40,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-28 08:27:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-28 08:27:40,375 INFO L87 Difference]: Start difference. First operand 255 states and 288 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 08:27:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:40,685 INFO L93 Difference]: Finished difference Result 263 states and 296 transitions. [2021-12-28 08:27:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 08:27:40,685 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-28 08:27:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:40,686 INFO L225 Difference]: With dead ends: 263 [2021-12-28 08:27:40,686 INFO L226 Difference]: Without dead ends: 263 [2021-12-28 08:27:40,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 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:40,687 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 33 mSDsluCounter, 2598 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:40,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 2862 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 08:27:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-12-28 08:27:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2021-12-28 08:27:40,691 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:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 296 transitions. [2021-12-28 08:27:40,692 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 296 transitions. Word has length 45 [2021-12-28 08:27:40,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:40,694 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 296 transitions. [2021-12-28 08:27:40,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-28 08:27:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2021-12-28 08:27:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-28 08:27:40,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:40,696 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 08:27:40,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:40,907 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:40,907 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1953485173, now seen corresponding path program 2 times [2021-12-28 08:27:40,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:40,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131758514] [2021-12-28 08:27:40,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 08:27:40,909 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:40,920 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:40,921 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:41,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 08:27:41,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 08:27:41,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 08:27:41,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:41,249 INFO L353 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2021-12-28 08:27:41,249 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:41,327 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:41,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:41,327 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:41,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131758514] [2021-12-28 08:27:41,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131758514] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:41,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:41,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 08:27:41,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229934344] [2021-12-28 08:27:41,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:41,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 08:27:41,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 08:27:41,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 08:27:41,328 INFO L87 Difference]: Start difference. First operand 263 states and 296 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:42,610 INFO L93 Difference]: Finished difference Result 445 states and 509 transitions. [2021-12-28 08:27:42,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 08:27:42,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 53 [2021-12-28 08:27:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:42,613 INFO L225 Difference]: With dead ends: 445 [2021-12-28 08:27:42,613 INFO L226 Difference]: Without dead ends: 445 [2021-12-28 08:27:42,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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:42,614 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 667 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 722 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:42,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 722 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:42,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-12-28 08:27:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 369. [2021-12-28 08:27:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 285 states have (on average 1.7228070175438597) internal successors, (491), 364 states have internal predecessors, (491), 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:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 497 transitions. [2021-12-28 08:27:42,631 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 497 transitions. Word has length 53 [2021-12-28 08:27:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:42,631 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 497 transitions. [2021-12-28 08:27:42,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 497 transitions. [2021-12-28 08:27:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 08:27:42,632 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:42,632 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] [2021-12-28 08:27:42,644 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:42,841 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:42,841 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:42,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash -530101490, now seen corresponding path program 1 times [2021-12-28 08:27:42,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:42,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062221069] [2021-12-28 08:27:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:42,843 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:42,845 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:42,846 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:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:43,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 08:27:43,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:43,343 INFO L353 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2021-12-28 08:27:43,343 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:43,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 08:27:43,659 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-28 08:27:43,660 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:43,675 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 08:27:43,676 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:43,808 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:43,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:43,808 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:43,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062221069] [2021-12-28 08:27:43,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062221069] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:43,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:43,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 08:27:43,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266317353] [2021-12-28 08:27:43,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:43,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 08:27:43,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 08:27:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-28 08:27:43,809 INFO L87 Difference]: Start difference. First operand 369 states and 497 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:43,903 INFO L93 Difference]: Finished difference Result 370 states and 498 transitions. [2021-12-28 08:27:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 08:27:43,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 56 [2021-12-28 08:27:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:43,905 INFO L225 Difference]: With dead ends: 370 [2021-12-28 08:27:43,905 INFO L226 Difference]: Without dead ends: 370 [2021-12-28 08:27:43,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 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:43,906 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 5 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:43,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1279 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 220 Unchecked, 0.0s Time] [2021-12-28 08:27:43,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-28 08:27:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2021-12-28 08:27:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 286 states have (on average 1.7202797202797202) internal successors, (492), 365 states have internal predecessors, (492), 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:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 498 transitions. [2021-12-28 08:27:43,913 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 498 transitions. Word has length 56 [2021-12-28 08:27:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:43,913 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 498 transitions. [2021-12-28 08:27:43,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 498 transitions. [2021-12-28 08:27:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-28 08:27:43,914 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:43,915 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] [2021-12-28 08:27:43,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-28 08:27:44,127 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:44,127 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash 746722395, now seen corresponding path program 1 times [2021-12-28 08:27:44,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:44,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020124068] [2021-12-28 08:27:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:44,129 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:44,140 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:44,154 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:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:44,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 08:27:44,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:44,504 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:44,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:44,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:44,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020124068] [2021-12-28 08:27:44,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020124068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:44,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:44,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 08:27:44,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905317112] [2021-12-28 08:27:44,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:44,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:27:44,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:44,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:27:44,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:27:44,507 INFO L87 Difference]: Start difference. First operand 370 states and 498 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:44,902 INFO L93 Difference]: Finished difference Result 387 states and 518 transitions. [2021-12-28 08:27:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:27:44,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 57 [2021-12-28 08:27:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:44,904 INFO L225 Difference]: With dead ends: 387 [2021-12-28 08:27:44,904 INFO L226 Difference]: Without dead ends: 387 [2021-12-28 08:27:44,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 08:27:44,905 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 394 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:44,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 244 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 08:27:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-12-28 08:27:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 363. [2021-12-28 08:27:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 286 states have (on average 1.6713286713286712) internal successors, (478), 358 states have internal predecessors, (478), 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:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 484 transitions. [2021-12-28 08:27:44,910 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 484 transitions. Word has length 57 [2021-12-28 08:27:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:44,910 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 484 transitions. [2021-12-28 08:27:44,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 484 transitions. [2021-12-28 08:27:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-28 08:27:44,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:44,911 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] [2021-12-28 08:27:44,922 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:45,118 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:45,118 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash 746722396, now seen corresponding path program 1 times [2021-12-28 08:27:45,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:45,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771214110] [2021-12-28 08:27:45,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:45,119 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:45,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:45,120 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:45,122 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:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:45,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 08:27:45,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:45,470 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:45,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:45,470 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:45,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771214110] [2021-12-28 08:27:45,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771214110] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:45,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:45,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 08:27:45,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289939804] [2021-12-28 08:27:45,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:45,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 08:27:45,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:45,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 08:27:45,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 08:27:45,473 INFO L87 Difference]: Start difference. First operand 363 states and 484 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:45,715 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2021-12-28 08:27:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 08:27:45,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 57 [2021-12-28 08:27:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:45,717 INFO L225 Difference]: With dead ends: 279 [2021-12-28 08:27:45,717 INFO L226 Difference]: Without dead ends: 279 [2021-12-28 08:27:45,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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:45,718 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 258 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 924 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:45,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 924 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:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-28 08:27:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2021-12-28 08:27:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 181 states have (on average 1.580110497237569) internal successors, (286), 253 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:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 290 transitions. [2021-12-28 08:27:45,721 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 290 transitions. Word has length 57 [2021-12-28 08:27:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:45,721 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 290 transitions. [2021-12-28 08:27:45,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 290 transitions. [2021-12-28 08:27:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-28 08:27:45,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:45,722 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:45,742 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:45,922 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:45,923 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1673575759, now seen corresponding path program 1 times [2021-12-28 08:27:45,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:45,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348496815] [2021-12-28 08:27:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:45,924 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:45,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:45,925 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:45,926 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:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:46,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 08:27:46,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:46,284 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:46,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:46,284 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348496815] [2021-12-28 08:27:46,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348496815] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:46,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:46,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 08:27:46,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298216423] [2021-12-28 08:27:46,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:46,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 08:27:46,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:46,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 08:27:46,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 08:27:46,286 INFO L87 Difference]: Start difference. First operand 257 states and 290 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:46,997 INFO L93 Difference]: Finished difference Result 275 states and 309 transitions. [2021-12-28 08:27:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 08:27:46,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:46,999 INFO L225 Difference]: With dead ends: 275 [2021-12-28 08:27:46,999 INFO L226 Difference]: Without dead ends: 275 [2021-12-28 08:27:46,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:46,999 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 254 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:46,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 624 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-28 08:27:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-28 08:27:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2021-12-28 08:27:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 193 states have (on average 1.5751295336787565) internal successors, (304), 264 states have internal predecessors, (304), 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,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2021-12-28 08:27:47,003 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 58 [2021-12-28 08:27:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:47,003 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2021-12-28 08:27:47,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2021-12-28 08:27:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-28 08:27:47,004 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:47,004 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:47,029 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:47,204 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:47,204 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash 341240963, now seen corresponding path program 1 times [2021-12-28 08:27:47,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:47,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575719497] [2021-12-28 08:27:47,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:47,206 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:47,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:47,207 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:47,208 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:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:47,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-28 08:27:47,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:47,831 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-28 08:27:47,831 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:47,871 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-28 08:27:47,871 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:48,095 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 08:27:48,095 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 17 treesize of output 23 [2021-12-28 08:27:48,132 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 08:27:48,132 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:48,311 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:48,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:48,312 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:48,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575719497] [2021-12-28 08:27:48,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575719497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:48,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:48,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 08:27:48,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098099817] [2021-12-28 08:27:48,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:48,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 08:27:48,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 08:27:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-28 08:27:48,313 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:48,408 INFO L93 Difference]: Finished difference Result 268 states and 307 transitions. [2021-12-28 08:27:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 08:27:48,409 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:48,410 INFO L225 Difference]: With dead ends: 268 [2021-12-28 08:27:48,410 INFO L226 Difference]: Without dead ends: 268 [2021-12-28 08:27:48,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 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:48,411 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:48,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1353 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 329 Unchecked, 0.0s Time] [2021-12-28 08:27:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-12-28 08:27:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2021-12-28 08:27:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 193 states have (on average 1.5699481865284974) internal successors, (303), 264 states have internal predecessors, (303), 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,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 307 transitions. [2021-12-28 08:27:48,415 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 307 transitions. Word has length 59 [2021-12-28 08:27:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:48,415 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 307 transitions. [2021-12-28 08:27:48,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 307 transitions. [2021-12-28 08:27:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-28 08:27:48,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:48,419 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:48,443 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:48,632 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:48,632 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:48,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:48,632 INFO L85 PathProgramCache]: Analyzing trace with hash 341240962, now seen corresponding path program 1 times [2021-12-28 08:27:48,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:48,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141651982] [2021-12-28 08:27:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:48,633 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:48,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:48,634 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:48,650 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:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:49,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 08:27:49,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:49,088 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-28 08:27:49,088 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:49,125 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 08:27:49,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2021-12-28 08:27:49,146 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,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:49,146 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:49,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141651982] [2021-12-28 08:27:49,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141651982] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:49,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:49,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 08:27:49,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138261380] [2021-12-28 08:27:49,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:49,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 08:27:49,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:49,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 08:27:49,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 08:27:49,148 INFO L87 Difference]: Start difference. First operand 268 states and 307 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:49,507 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2021-12-28 08:27:49,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 08:27:49,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:49,508 INFO L225 Difference]: With dead ends: 275 [2021-12-28 08:27:49,508 INFO L226 Difference]: Without dead ends: 275 [2021-12-28 08:27:49,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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:49,509 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 210 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:49,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 354 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 08:27:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-28 08:27:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2021-12-28 08:27:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 198 states have (on average 1.5656565656565657) internal successors, (310), 268 states have internal predecessors, (310), 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,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 314 transitions. [2021-12-28 08:27:49,512 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 314 transitions. Word has length 59 [2021-12-28 08:27:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:49,513 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 314 transitions. [2021-12-28 08:27:49,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 314 transitions. [2021-12-28 08:27:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-28 08:27:49,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:49,513 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] [2021-12-28 08:27:49,543 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:49,724 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:49,724 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:49,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:49,724 INFO L85 PathProgramCache]: Analyzing trace with hash -278071788, now seen corresponding path program 1 times [2021-12-28 08:27:49,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:49,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976454016] [2021-12-28 08:27:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:49,725 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:49,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:49,727 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:49,729 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:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:50,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 08:27:50,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:50,336 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:50,367 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:50,522 INFO L353 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2021-12-28 08:27:50,522 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:50,593 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:50,605 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,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:50,605 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:50,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976454016] [2021-12-28 08:27:50,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976454016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:50,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:50,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 08:27:50,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769614706] [2021-12-28 08:27:50,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:50,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 08:27:50,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:50,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 08:27:50,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-28 08:27:50,606 INFO L87 Difference]: Start difference. First operand 272 states and 314 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:51,539 INFO L93 Difference]: Finished difference Result 270 states and 310 transitions. [2021-12-28 08:27:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 08:27:51,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 62 [2021-12-28 08:27:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:51,540 INFO L225 Difference]: With dead ends: 270 [2021-12-28 08:27:51,540 INFO L226 Difference]: Without dead ends: 270 [2021-12-28 08:27:51,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-28 08:27:51,541 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 236 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:51,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 1002 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-28 08:27:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-12-28 08:27:51,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-12-28 08:27:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 198 states have (on average 1.5454545454545454) internal successors, (306), 266 states have internal predecessors, (306), 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:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 310 transitions. [2021-12-28 08:27:51,544 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 310 transitions. Word has length 62 [2021-12-28 08:27:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:51,545 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 310 transitions. [2021-12-28 08:27:51,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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,545 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 310 transitions. [2021-12-28 08:27:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-28 08:27:51,545 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:51,545 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] [2021-12-28 08:27:51,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:51,745 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:51,746 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:51,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash -278071787, now seen corresponding path program 1 times [2021-12-28 08:27:51,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:51,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499152530] [2021-12-28 08:27:51,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:51,747 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:51,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:51,748 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:51,749 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:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:52,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 08:27:52,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:52,399 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:27:52,417 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:52,469 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:27:52,481 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:27:52,552 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:27:52,561 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:27:52,610 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:27:52,614 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:27:52,628 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,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:52,628 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:52,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499152530] [2021-12-28 08:27:52,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499152530] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:52,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:52,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 08:27:52,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240521220] [2021-12-28 08:27:52,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:52,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 08:27:52,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 08:27:52,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 08:27:52,629 INFO L87 Difference]: Start difference. First operand 270 states and 310 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:53,813 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2021-12-28 08:27:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 08:27:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 62 [2021-12-28 08:27:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:53,815 INFO L225 Difference]: With dead ends: 269 [2021-12-28 08:27:53,815 INFO L226 Difference]: Without dead ends: 269 [2021-12-28 08:27:53,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-28 08:27:53,816 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 233 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:53,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 836 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 08:27:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-28 08:27:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2021-12-28 08:27:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 198 states have (on average 1.5353535353535352) internal successors, (304), 265 states have internal predecessors, (304), 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,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 308 transitions. [2021-12-28 08:27:53,820 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 308 transitions. Word has length 62 [2021-12-28 08:27:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:53,820 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 308 transitions. [2021-12-28 08:27:53,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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,820 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 308 transitions. [2021-12-28 08:27:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-28 08:27:53,820 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:53,820 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] [2021-12-28 08:27:53,837 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:54,036 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:54,036 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash -450354753, now seen corresponding path program 1 times [2021-12-28 08:27:54,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:54,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889999443] [2021-12-28 08:27:54,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:54,037 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:54,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:54,038 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:54,040 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:27:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:54,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 08:27:54,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:54,613 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:27:54,658 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 08:27:54,658 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:27:54,700 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:27:54,775 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:27:54,879 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:27:54,879 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:27:54,929 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:27:55,004 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,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:55,004 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:55,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889999443] [2021-12-28 08:27:55,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889999443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:55,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:55,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 08:27:55,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564460847] [2021-12-28 08:27:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:55,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 08:27:55,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:55,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 08:27:55,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-28 08:27:55,005 INFO L87 Difference]: Start difference. First operand 269 states and 308 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:55,890 INFO L93 Difference]: Finished difference Result 290 states and 330 transitions. [2021-12-28 08:27:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 08:27:55,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-12-28 08:27:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:55,892 INFO L225 Difference]: With dead ends: 290 [2021-12-28 08:27:55,892 INFO L226 Difference]: Without dead ends: 290 [2021-12-28 08:27:55,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 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:27:55,893 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 457 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:55,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 668 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 273 Invalid, 0 Unknown, 91 Unchecked, 0.7s Time] [2021-12-28 08:27:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-28 08:27:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 278. [2021-12-28 08:27:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 207 states have (on average 1.541062801932367) internal successors, (319), 274 states have internal predecessors, (319), 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,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 323 transitions. [2021-12-28 08:27:55,899 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 323 transitions. Word has length 66 [2021-12-28 08:27:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:55,900 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 323 transitions. [2021-12-28 08:27:55,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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,900 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 323 transitions. [2021-12-28 08:27:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-28 08:27:55,900 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:55,901 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] [2021-12-28 08:27:55,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-28 08:27:56,112 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:27:56,112 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:56,113 INFO L85 PathProgramCache]: Analyzing trace with hash -450354752, now seen corresponding path program 1 times [2021-12-28 08:27:56,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:56,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695872561] [2021-12-28 08:27:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:56,113 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:56,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:56,115 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:27:56,116 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:27:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:56,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 08:27:56,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:56,721 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:27:56,751 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:56,778 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 08:27:56,778 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:27:56,807 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:27:56,817 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:27:56,905 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:27:56,915 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:27:57,015 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:27:57,016 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:27:57,023 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:27:57,119 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:27:57,122 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:27:57,141 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,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 08:27:57,141 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:27:57,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695872561] [2021-12-28 08:27:57,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695872561] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 08:27:57,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 08:27:57,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 08:27:57,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478736062] [2021-12-28 08:27:57,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 08:27:57,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 08:27:57,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:27:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 08:27:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-28 08:27:57,142 INFO L87 Difference]: Start difference. First operand 278 states and 323 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:27:58,787 INFO L93 Difference]: Finished difference Result 290 states and 327 transitions. [2021-12-28 08:27:58,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 08:27:58,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-12-28 08:27:58,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:27:58,788 INFO L225 Difference]: With dead ends: 290 [2021-12-28 08:27:58,788 INFO L226 Difference]: Without dead ends: 290 [2021-12-28 08:27:58,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 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:27:58,789 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 476 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-28 08:27:58,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 694 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-28 08:27:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-28 08:27:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 278. [2021-12-28 08:27:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 207 states have (on average 1.5217391304347827) internal successors, (315), 274 states have internal predecessors, (315), 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:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 319 transitions. [2021-12-28 08:27:58,792 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 319 transitions. Word has length 66 [2021-12-28 08:27:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:27:58,793 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 319 transitions. [2021-12-28 08:27:58,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 319 transitions. [2021-12-28 08:27:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-28 08:27:58,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:27:58,793 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] [2021-12-28 08:27:58,824 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:27:58,993 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:27:58,994 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:27:58,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:27:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1408765628, now seen corresponding path program 1 times [2021-12-28 08:27:58,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:27:58,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046793702] [2021-12-28 08:27:58,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:27:58,995 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:27:58,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:27:58,996 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:27:58,998 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:27:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:27:59,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-28 08:27:59,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:27:59,671 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:27:59,712 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 08:27:59,712 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:27:59,744 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:27:59,849 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:27:59,967 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:27:59,968 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:00,078 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:28:00,078 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:00,130 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:00,224 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:00,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:28:00,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1318) |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|))) (_ bv1 1))) is different from false [2021-12-28 08:28:00,329 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (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_1318) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2021-12-28 08:28:00,392 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1317 (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_1317))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1318)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2021-12-28 08:28:00,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1317 (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_1317))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1318)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2021-12-28 08:28:00,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1317 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1316))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1317)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1318)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2021-12-28 08:28:00,534 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 08:28:00,534 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:00,540 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 4375 treesize of output 3232 [2021-12-28 08:28:00,567 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 3228 treesize of output 2682 [2021-12-28 08:28:00,585 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 2682 treesize of output 2626 [2021-12-28 08:28:00,598 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 2626 treesize of output 2094 [2021-12-28 08:28:27,346 INFO L353 Elim1Store]: treesize reduction -11, result has 113.6 percent of original size [2021-12-28 08:28:27,347 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 154 treesize of output 231 [2021-12-28 08:28:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 3 not checked. [2021-12-28 08:28:28,055 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 08:28:28,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046793702] [2021-12-28 08:28:28,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046793702] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 08:28:28,055 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 08:28:28,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2021-12-28 08:28:28,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563947926] [2021-12-28 08:28:28,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 08:28:28,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-28 08:28:28,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 08:28:28,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-28 08:28:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=143, Unknown=5, NotChecked=140, Total=342 [2021-12-28 08:28:28,057 INFO L87 Difference]: Start difference. First operand 278 states and 319 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 08:28:29,948 INFO L93 Difference]: Finished difference Result 446 states and 515 transitions. [2021-12-28 08:28:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 08:28:29,949 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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 71 [2021-12-28 08:28:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 08:28:29,951 INFO L225 Difference]: With dead ends: 446 [2021-12-28 08:28:29,951 INFO L226 Difference]: Without dead ends: 446 [2021-12-28 08:28:29,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 123 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=84, Invalid=203, Unknown=5, NotChecked=170, Total=462 [2021-12-28 08:28:29,951 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 659 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2400 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 08:28:29,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [660 Valid, 1798 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 325 Invalid, 0 Unknown, 2400 Unchecked, 1.2s Time] [2021-12-28 08:28:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-12-28 08:28:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 296. [2021-12-28 08:28:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 225 states have (on average 1.5155555555555555) internal successors, (341), 292 states have internal predecessors, (341), 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:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 345 transitions. [2021-12-28 08:28:29,957 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 345 transitions. Word has length 71 [2021-12-28 08:28:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 08:28:29,957 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 345 transitions. [2021-12-28 08:28:29,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 345 transitions. [2021-12-28 08:28:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-28 08:28:29,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 08:28:29,958 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] [2021-12-28 08:28:29,988 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:30,158 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:30,158 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-28 08:28:30,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 08:28:30,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1408765627, now seen corresponding path program 1 times [2021-12-28 08:28:30,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 08:28:30,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685418847] [2021-12-28 08:28:30,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 08:28:30,160 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 08:28:30,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 08:28:30,161 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:30,162 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:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 08:28:30,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-28 08:28:30,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 08:28:30,888 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:30,917 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:30,929 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 08:28:30,929 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:30,959 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:30,972 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:31,055 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:31,062 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:31,189 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:28:31,190 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:31,196 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:31,366 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 08:28:31,366 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:31,373 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:31,491 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:31,495 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:31,523 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:31,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 08:28:32,674 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (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_1436) |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_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1436) |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:32,804 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (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|) .cse2) v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2021-12-28 08:28:32,948 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse2 (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|) .cse2) v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2021-12-28 08:28:33,038 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1435)) (.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_1434) .cse0 v_ArrVal_1436) |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_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (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_1434) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1436) |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:33,241 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (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_1435))) (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_1434) .cse1 v_ArrVal_1436) |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_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (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_1434) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1435) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1436)) |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:33,421 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1433 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1432 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1432)) (.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 .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1435))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1433) .cse0 v_ArrVal_1434) .cse1 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1433 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1432 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 ((_ sign_extend 32) (_ bv1 32))) (.cse6 (let ((.cse9 (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 ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1432))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1433) .cse7 v_ArrVal_1434) (select (select (store .cse8 .cse7 v_ArrVal_1435) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_1436))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9)))) (bvule (bvadd .cse5 .cse6) (bvadd .cse5 (_ bv1 64) .cse6))))) is different from false [2021-12-28 08:28:33,530 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 08:28:33,530 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:33,548 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 08:28:33,548 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:33,578 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 81375 treesize of output 68388 [2021-12-28 08:28:34,766 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 1245093 treesize of output 1204764