./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2fd96106837ff3ee9325c248fea6969b94a5a1f2cee078fd159398f70369aafc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:01:34,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:01:34,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:01:34,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:01:34,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:01:34,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:01:34,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:01:34,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:01:34,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:01:34,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:01:34,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:01:34,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:01:34,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:01:34,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:01:34,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:01:34,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:01:34,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:01:34,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:01:34,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:01:34,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:01:34,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:01:34,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:01:34,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:01:34,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:01:34,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:01:34,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:01:34,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:01:34,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:01:34,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:01:34,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:01:34,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:01:34,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:01:34,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:01:34,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:01:34,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:01:34,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:01:34,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:01:34,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:01:34,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:01:34,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:01:34,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:01:34,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 20:01:34,121 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:01:34,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:01:34,122 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:01:34,122 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:01:34,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:01:34,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:01:34,124 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:01:34,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:01:34,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 20:01:34,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:01:34,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:01:34,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:01:34,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:01:34,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:01:34,125 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:01:34,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:01:34,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:01:34,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:01:34,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:01:34,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:01:34,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:01:34,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:01:34,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:01:34,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 20:01:34,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 20:01:34,127 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:01:34,127 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:01:34,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:01:34,127 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:01:34,127 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 ! call(reach_error())) ) 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 -> 2fd96106837ff3ee9325c248fea6969b94a5a1f2cee078fd159398f70369aafc [2021-11-22 20:01:34,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:01:34,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:01:34,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:01:34,356 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:01:34,371 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:01:34,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_harness.i [2021-11-22 20:01:34,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba463617/632a1b5280c94f7dab85f316606e8a8d/FLAG14cf8c47a [2021-11-22 20:01:35,101 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:01:35,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_harness.i [2021-11-22 20:01:35,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba463617/632a1b5280c94f7dab85f316606e8a8d/FLAG14cf8c47a [2021-11-22 20:01:35,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba463617/632a1b5280c94f7dab85f316606e8a8d [2021-11-22 20:01:35,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:01:35,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:01:35,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:01:35,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:01:35,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:01:35,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:01:35" (1/1) ... [2021-11-22 20:01:35,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71fdabe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:35, skipping insertion in model container [2021-11-22 20:01:35,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:01:35" (1/1) ... [2021-11-22 20:01:35,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:01:35,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:01:35,601 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/aws-c-common/aws_byte_cursor_trim_pred_harness.i[4499,4512] [2021-11-22 20:01:35,607 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/aws-c-common/aws_byte_cursor_trim_pred_harness.i[4559,4572] [2021-11-22 20:01:36,099 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,100 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,100 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,101 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,101 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,108 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,109 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,110 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,110 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,310 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:01:36,311 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:01:36,312 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:01:36,313 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:01:36,313 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:01:36,314 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:01:36,314 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:01:36,315 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:01:36,315 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:01:36,316 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:01:36,420 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:01:36,519 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:01:36,691 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:01:36,709 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/aws-c-common/aws_byte_cursor_trim_pred_harness.i[4499,4512] [2021-11-22 20:01:36,709 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/aws-c-common/aws_byte_cursor_trim_pred_harness.i[4559,4572] [2021-11-22 20:01:36,727 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,727 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,727 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,728 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,728 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,731 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,732 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,732 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,733 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,767 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:01:36,768 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:01:36,768 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:01:36,769 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:01:36,769 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:01:36,769 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:01:36,770 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:01:36,770 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:01:36,771 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:01:36,771 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:01:36,785 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:01:36,827 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,828 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:01:36,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:01:37,046 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:01:37,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37 WrapperNode [2021-11-22 20:01:37,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:01:37,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:01:37,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:01:37,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:01:37,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (1/1) ... [2021-11-22 20:01:37,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (1/1) ... [2021-11-22 20:01:37,206 INFO L137 Inliner]: procedures = 690, calls = 2620, calls flagged for inlining = 951, calls inlined = 48, statements flattened = 1443 [2021-11-22 20:01:37,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:01:37,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:01:37,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:01:37,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:01:37,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (1/1) ... [2021-11-22 20:01:37,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (1/1) ... [2021-11-22 20:01:37,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (1/1) ... [2021-11-22 20:01:37,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (1/1) ... [2021-11-22 20:01:37,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (1/1) ... [2021-11-22 20:01:37,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (1/1) ... [2021-11-22 20:01:37,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (1/1) ... [2021-11-22 20:01:37,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:01:37,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:01:37,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:01:37,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:01:37,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (1/1) ... [2021-11-22 20:01:37,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:01:37,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:01:37,328 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-11-22 20:01:37,351 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-11-22 20:01:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:01:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 20:01:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:01:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:01:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:01:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:01:37,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:01:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:01:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:01:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:01:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 20:01:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 20:01:37,599 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:01:37,600 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:01:38,462 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:01:38,468 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:01:38,468 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-22 20:01:38,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:01:38 BoogieIcfgContainer [2021-11-22 20:01:38,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:01:38,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:01:38,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:01:38,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:01:38,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:01:35" (1/3) ... [2021-11-22 20:01:38,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a782bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:01:38, skipping insertion in model container [2021-11-22 20:01:38,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:01:37" (2/3) ... [2021-11-22 20:01:38,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a782bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:01:38, skipping insertion in model container [2021-11-22 20:01:38,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:01:38" (3/3) ... [2021-11-22 20:01:38,475 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_trim_pred_harness.i [2021-11-22 20:01:38,478 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:01:38,478 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2021-11-22 20:01:38,505 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:01:38,509 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-11-22 20:01:38,509 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-11-22 20:01:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 212 states have (on average 1.4622641509433962) internal successors, (310), 221 states have internal predecessors, (310), 0 states have call successors, (0), 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-11-22 20:01:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 20:01:38,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:38,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:38,525 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:38,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:38,528 INFO L85 PathProgramCache]: Analyzing trace with hash 421514890, now seen corresponding path program 1 times [2021-11-22 20:01:38,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:38,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829435294] [2021-11-22 20:01:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:38,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:38,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:38,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829435294] [2021-11-22 20:01:38,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829435294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:38,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:38,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 20:01:38,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486888891] [2021-11-22 20:01:38,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:38,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 20:01:38,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:38,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 20:01:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:01:38,933 INFO L87 Difference]: Start difference. First operand has 222 states, 212 states have (on average 1.4622641509433962) internal successors, (310), 221 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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-11-22 20:01:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:38,971 INFO L93 Difference]: Finished difference Result 440 states and 615 transitions. [2021-11-22 20:01:38,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 20:01:38,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-22 20:01:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:38,979 INFO L225 Difference]: With dead ends: 440 [2021-11-22 20:01:38,980 INFO L226 Difference]: Without dead ends: 215 [2021-11-22 20:01:38,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:01:38,984 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:38,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:01:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-22 20:01:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-11-22 20:01:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 206 states have (on average 1.3592233009708738) internal successors, (280), 214 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-22 20:01:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 280 transitions. [2021-11-22 20:01:39,014 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 280 transitions. Word has length 37 [2021-11-22 20:01:39,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:39,015 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 280 transitions. [2021-11-22 20:01:39,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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-11-22 20:01:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 280 transitions. [2021-11-22 20:01:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 20:01:39,016 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:39,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:39,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 20:01:39,017 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:39,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash -664833379, now seen corresponding path program 1 times [2021-11-22 20:01:39,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:39,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956978118] [2021-11-22 20:01:39,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:39,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:39,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:39,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956978118] [2021-11-22 20:01:39,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956978118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:39,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:39,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:01:39,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791523344] [2021-11-22 20:01:39,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:39,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:01:39,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:39,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:01:39,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:01:39,142 INFO L87 Difference]: Start difference. First operand 215 states and 280 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:39,268 INFO L93 Difference]: Finished difference Result 409 states and 533 transitions. [2021-11-22 20:01:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:01:39,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-22 20:01:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:39,270 INFO L225 Difference]: With dead ends: 409 [2021-11-22 20:01:39,270 INFO L226 Difference]: Without dead ends: 215 [2021-11-22 20:01:39,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-22 20:01:39,272 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 404 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:39,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 352 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:01:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-22 20:01:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-11-22 20:01:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 206 states have (on average 1.3446601941747574) internal successors, (277), 214 states have internal predecessors, (277), 0 states have call successors, (0), 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-11-22 20:01:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 277 transitions. [2021-11-22 20:01:39,280 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 277 transitions. Word has length 39 [2021-11-22 20:01:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:39,281 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 277 transitions. [2021-11-22 20:01:39,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 277 transitions. [2021-11-22 20:01:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-22 20:01:39,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:39,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:39,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 20:01:39,283 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:39,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2046081283, now seen corresponding path program 1 times [2021-11-22 20:01:39,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:39,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236598873] [2021-11-22 20:01:39,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:39,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:39,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:39,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236598873] [2021-11-22 20:01:39,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236598873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:39,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:39,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:01:39,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138324965] [2021-11-22 20:01:39,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:39,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:01:39,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:39,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:01:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:01:39,466 INFO L87 Difference]: Start difference. First operand 215 states and 277 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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-11-22 20:01:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:39,555 INFO L93 Difference]: Finished difference Result 376 states and 485 transitions. [2021-11-22 20:01:39,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:01:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-22 20:01:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:39,557 INFO L225 Difference]: With dead ends: 376 [2021-11-22 20:01:39,557 INFO L226 Difference]: Without dead ends: 215 [2021-11-22 20:01:39,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:01:39,563 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 626 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:39,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 377 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:01:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-22 20:01:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-11-22 20:01:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 214 states have internal predecessors, (275), 0 states have call successors, (0), 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-11-22 20:01:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 275 transitions. [2021-11-22 20:01:39,584 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 275 transitions. Word has length 43 [2021-11-22 20:01:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:39,584 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 275 transitions. [2021-11-22 20:01:39,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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-11-22 20:01:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 275 transitions. [2021-11-22 20:01:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-22 20:01:39,587 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:39,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:39,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 20:01:39,589 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:39,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:39,590 INFO L85 PathProgramCache]: Analyzing trace with hash 226547298, now seen corresponding path program 1 times [2021-11-22 20:01:39,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:39,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137858081] [2021-11-22 20:01:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:39,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:39,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:39,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137858081] [2021-11-22 20:01:39,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137858081] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:39,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:39,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:01:39,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181632302] [2021-11-22 20:01:39,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:39,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:01:39,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:01:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:01:39,752 INFO L87 Difference]: Start difference. First operand 215 states and 275 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:39,896 INFO L93 Difference]: Finished difference Result 355 states and 454 transitions. [2021-11-22 20:01:39,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:01:39,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-22 20:01:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:39,898 INFO L225 Difference]: With dead ends: 355 [2021-11-22 20:01:39,898 INFO L226 Difference]: Without dead ends: 215 [2021-11-22 20:01:39,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:01:39,899 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 832 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:39,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [832 Valid, 420 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:01:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-22 20:01:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-11-22 20:01:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 206 states have (on average 1.3300970873786409) internal successors, (274), 214 states have internal predecessors, (274), 0 states have call successors, (0), 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-11-22 20:01:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 274 transitions. [2021-11-22 20:01:39,903 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 274 transitions. Word has length 45 [2021-11-22 20:01:39,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:39,903 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 274 transitions. [2021-11-22 20:01:39,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 274 transitions. [2021-11-22 20:01:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-22 20:01:39,904 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:39,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:39,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 20:01:39,905 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:39,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1272350845, now seen corresponding path program 1 times [2021-11-22 20:01:39,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:39,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874962501] [2021-11-22 20:01:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:39,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:40,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:40,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874962501] [2021-11-22 20:01:40,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874962501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:40,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:40,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:01:40,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534062969] [2021-11-22 20:01:40,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:40,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:01:40,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:40,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:01:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:01:40,145 INFO L87 Difference]: Start difference. First operand 215 states and 274 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:40,481 INFO L93 Difference]: Finished difference Result 454 states and 559 transitions. [2021-11-22 20:01:40,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:01:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-22 20:01:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:40,483 INFO L225 Difference]: With dead ends: 454 [2021-11-22 20:01:40,483 INFO L226 Difference]: Without dead ends: 438 [2021-11-22 20:01:40,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:01:40,484 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 376 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:40,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 1295 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:01:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-11-22 20:01:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 247. [2021-11-22 20:01:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 238 states have (on average 1.2857142857142858) internal successors, (306), 246 states have internal predecessors, (306), 0 states have call successors, (0), 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-11-22 20:01:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 306 transitions. [2021-11-22 20:01:40,490 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 306 transitions. Word has length 47 [2021-11-22 20:01:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:40,490 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 306 transitions. [2021-11-22 20:01:40,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 306 transitions. [2021-11-22 20:01:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 20:01:40,491 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:40,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:40,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 20:01:40,492 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 100438901, now seen corresponding path program 1 times [2021-11-22 20:01:40,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:40,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383141593] [2021-11-22 20:01:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:40,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:40,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:40,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383141593] [2021-11-22 20:01:40,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383141593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:40,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:40,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 20:01:40,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63238564] [2021-11-22 20:01:40,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:40,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 20:01:40,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:40,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 20:01:40,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:01:40,736 INFO L87 Difference]: Start difference. First operand 247 states and 306 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:41,824 INFO L93 Difference]: Finished difference Result 847 states and 1044 transitions. [2021-11-22 20:01:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 20:01:41,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-22 20:01:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:41,827 INFO L225 Difference]: With dead ends: 847 [2021-11-22 20:01:41,827 INFO L226 Difference]: Without dead ends: 626 [2021-11-22 20:01:41,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2021-11-22 20:01:41,828 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 1183 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:41,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1183 Valid, 1847 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 20:01:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-11-22 20:01:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 517. [2021-11-22 20:01:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 508 states have (on average 1.279527559055118) internal successors, (650), 516 states have internal predecessors, (650), 0 states have call successors, (0), 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-11-22 20:01:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 650 transitions. [2021-11-22 20:01:41,842 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 650 transitions. Word has length 51 [2021-11-22 20:01:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:41,843 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 650 transitions. [2021-11-22 20:01:41,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 650 transitions. [2021-11-22 20:01:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-22 20:01:41,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:41,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:41,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 20:01:41,844 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2135201165, now seen corresponding path program 1 times [2021-11-22 20:01:41,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:41,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302016247] [2021-11-22 20:01:41,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:41,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:41,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:41,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302016247] [2021-11-22 20:01:41,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302016247] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:41,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:41,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:01:41,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164783475] [2021-11-22 20:01:41,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:41,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:01:41,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:41,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:01:41,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:01:41,978 INFO L87 Difference]: Start difference. First operand 517 states and 650 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-11-22 20:01:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:42,037 INFO L93 Difference]: Finished difference Result 827 states and 1045 transitions. [2021-11-22 20:01:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:01:42,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-22 20:01:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:42,040 INFO L225 Difference]: With dead ends: 827 [2021-11-22 20:01:42,040 INFO L226 Difference]: Without dead ends: 517 [2021-11-22 20:01:42,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-22 20:01:42,041 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 168 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:42,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 576 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:01:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-11-22 20:01:42,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2021-11-22 20:01:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 508 states have (on average 1.2736220472440944) internal successors, (647), 516 states have internal predecessors, (647), 0 states have call successors, (0), 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-11-22 20:01:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 647 transitions. [2021-11-22 20:01:42,053 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 647 transitions. Word has length 52 [2021-11-22 20:01:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:42,054 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 647 transitions. [2021-11-22 20:01:42,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-11-22 20:01:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 647 transitions. [2021-11-22 20:01:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-22 20:01:42,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:42,055 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:42,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 20:01:42,056 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash 787623073, now seen corresponding path program 1 times [2021-11-22 20:01:42,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:42,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381240310] [2021-11-22 20:01:42,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:42,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:42,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:42,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381240310] [2021-11-22 20:01:42,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381240310] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:42,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:42,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 20:01:42,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358617621] [2021-11-22 20:01:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:42,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:01:42,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:42,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:01:42,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:01:42,144 INFO L87 Difference]: Start difference. First operand 517 states and 647 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:42,182 INFO L93 Difference]: Finished difference Result 707 states and 884 transitions. [2021-11-22 20:01:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:01:42,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-22 20:01:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:42,186 INFO L225 Difference]: With dead ends: 707 [2021-11-22 20:01:42,186 INFO L226 Difference]: Without dead ends: 520 [2021-11-22 20:01:42,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-22 20:01:42,187 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:42,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:01:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-11-22 20:01:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2021-11-22 20:01:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 511 states have (on average 1.2720156555772995) internal successors, (650), 519 states have internal predecessors, (650), 0 states have call successors, (0), 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-11-22 20:01:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 650 transitions. [2021-11-22 20:01:42,204 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 650 transitions. Word has length 54 [2021-11-22 20:01:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:42,205 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 650 transitions. [2021-11-22 20:01:42,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 650 transitions. [2021-11-22 20:01:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-22 20:01:42,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:42,208 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:42,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 20:01:42,209 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:42,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1742174083, now seen corresponding path program 1 times [2021-11-22 20:01:42,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:42,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118734363] [2021-11-22 20:01:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:42,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:42,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:42,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118734363] [2021-11-22 20:01:42,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118734363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:42,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:42,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:01:42,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695917536] [2021-11-22 20:01:42,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:42,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:01:42,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:42,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:01:42,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:01:42,432 INFO L87 Difference]: Start difference. First operand 520 states and 650 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-22 20:01:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:42,780 INFO L93 Difference]: Finished difference Result 1125 states and 1376 transitions. [2021-11-22 20:01:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:01:42,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-22 20:01:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:42,783 INFO L225 Difference]: With dead ends: 1125 [2021-11-22 20:01:42,783 INFO L226 Difference]: Without dead ends: 660 [2021-11-22 20:01:42,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:01:42,785 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 164 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:42,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 1216 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:01:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-11-22 20:01:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 520. [2021-11-22 20:01:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 511 states have (on average 1.2524461839530332) internal successors, (640), 519 states have internal predecessors, (640), 0 states have call successors, (0), 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-11-22 20:01:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 640 transitions. [2021-11-22 20:01:42,805 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 640 transitions. Word has length 55 [2021-11-22 20:01:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:42,805 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 640 transitions. [2021-11-22 20:01:42,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-22 20:01:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 640 transitions. [2021-11-22 20:01:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-22 20:01:42,806 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:42,807 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:42,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 20:01:42,807 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:42,808 INFO L85 PathProgramCache]: Analyzing trace with hash 278277693, now seen corresponding path program 1 times [2021-11-22 20:01:42,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:42,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683708745] [2021-11-22 20:01:42,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:42,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:01:43,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683708745] [2021-11-22 20:01:43,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683708745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:43,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:43,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 20:01:43,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745797251] [2021-11-22 20:01:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:43,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 20:01:43,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:43,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 20:01:43,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:01:43,046 INFO L87 Difference]: Start difference. First operand 520 states and 640 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:43,714 INFO L93 Difference]: Finished difference Result 916 states and 1110 transitions. [2021-11-22 20:01:43,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 20:01:43,715 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-22 20:01:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:43,716 INFO L225 Difference]: With dead ends: 916 [2021-11-22 20:01:43,716 INFO L226 Difference]: Without dead ends: 616 [2021-11-22 20:01:43,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-11-22 20:01:43,717 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 1084 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:43,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1084 Valid, 1736 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 20:01:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-11-22 20:01:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 517. [2021-11-22 20:01:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 508 states have (on average 1.25) internal successors, (635), 516 states have internal predecessors, (635), 0 states have call successors, (0), 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-11-22 20:01:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 635 transitions. [2021-11-22 20:01:43,737 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 635 transitions. Word has length 56 [2021-11-22 20:01:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:43,737 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 635 transitions. [2021-11-22 20:01:43,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 635 transitions. [2021-11-22 20:01:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 20:01:43,738 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:43,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:43,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 20:01:43,739 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash -203806622, now seen corresponding path program 1 times [2021-11-22 20:01:43,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:43,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699434601] [2021-11-22 20:01:43,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:43,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:43,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:43,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699434601] [2021-11-22 20:01:43,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699434601] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:43,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:43,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:01:43,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131839867] [2021-11-22 20:01:43,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:43,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:01:43,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:43,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:01:43,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:01:43,891 INFO L87 Difference]: Start difference. First operand 517 states and 635 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:44,199 INFO L93 Difference]: Finished difference Result 1103 states and 1345 transitions. [2021-11-22 20:01:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:01:44,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-22 20:01:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:44,201 INFO L225 Difference]: With dead ends: 1103 [2021-11-22 20:01:44,201 INFO L226 Difference]: Without dead ends: 650 [2021-11-22 20:01:44,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:01:44,202 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 372 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:44,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 541 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:01:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-11-22 20:01:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 517. [2021-11-22 20:01:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 508 states have (on average 1.202755905511811) internal successors, (611), 516 states have internal predecessors, (611), 0 states have call successors, (0), 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-11-22 20:01:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 611 transitions. [2021-11-22 20:01:44,217 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 611 transitions. Word has length 57 [2021-11-22 20:01:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:44,217 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 611 transitions. [2021-11-22 20:01:44,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 611 transitions. [2021-11-22 20:01:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 20:01:44,218 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:44,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:44,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 20:01:44,218 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:44,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1101199900, now seen corresponding path program 1 times [2021-11-22 20:01:44,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:44,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29784430] [2021-11-22 20:01:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:44,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:44,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:44,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29784430] [2021-11-22 20:01:44,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29784430] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:44,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:44,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:01:44,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589221110] [2021-11-22 20:01:44,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:44,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:01:44,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:44,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:01:44,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:01:44,433 INFO L87 Difference]: Start difference. First operand 517 states and 611 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:45,585 INFO L93 Difference]: Finished difference Result 1640 states and 1921 transitions. [2021-11-22 20:01:45,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-22 20:01:45,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-22 20:01:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:45,589 INFO L225 Difference]: With dead ends: 1640 [2021-11-22 20:01:45,589 INFO L226 Difference]: Without dead ends: 1304 [2021-11-22 20:01:45,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2021-11-22 20:01:45,590 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 2909 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:45,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2909 Valid, 1474 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 20:01:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2021-11-22 20:01:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 513. [2021-11-22 20:01:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 504 states have (on average 1.1964285714285714) internal successors, (603), 512 states have internal predecessors, (603), 0 states have call successors, (0), 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-11-22 20:01:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 603 transitions. [2021-11-22 20:01:45,608 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 603 transitions. Word has length 57 [2021-11-22 20:01:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:45,608 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 603 transitions. [2021-11-22 20:01:45,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 603 transitions. [2021-11-22 20:01:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-22 20:01:45,609 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:45,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:45,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 20:01:45,609 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:45,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash -746731616, now seen corresponding path program 1 times [2021-11-22 20:01:45,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:45,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549282615] [2021-11-22 20:01:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:45,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:45,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:45,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549282615] [2021-11-22 20:01:45,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549282615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:45,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:45,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 20:01:45,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135342928] [2021-11-22 20:01:45,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:45,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 20:01:45,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:45,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 20:01:45,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:01:45,824 INFO L87 Difference]: Start difference. First operand 513 states and 603 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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-11-22 20:01:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:46,841 INFO L93 Difference]: Finished difference Result 913 states and 1066 transitions. [2021-11-22 20:01:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-22 20:01:46,842 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-22 20:01:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:46,844 INFO L225 Difference]: With dead ends: 913 [2021-11-22 20:01:46,844 INFO L226 Difference]: Without dead ends: 689 [2021-11-22 20:01:46,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2021-11-22 20:01:46,845 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 1058 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:46,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1058 Valid, 1609 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 20:01:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-11-22 20:01:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 524. [2021-11-22 20:01:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 515 states have (on average 1.192233009708738) internal successors, (614), 523 states have internal predecessors, (614), 0 states have call successors, (0), 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-11-22 20:01:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 614 transitions. [2021-11-22 20:01:46,881 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 614 transitions. Word has length 58 [2021-11-22 20:01:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:46,881 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 614 transitions. [2021-11-22 20:01:46,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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-11-22 20:01:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 614 transitions. [2021-11-22 20:01:46,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 20:01:46,885 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:46,885 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:01:46,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 20:01:46,890 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash -636032722, now seen corresponding path program 1 times [2021-11-22 20:01:46,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:46,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630999349] [2021-11-22 20:01:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:46,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:01:47,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:47,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630999349] [2021-11-22 20:01:47,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630999349] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:47,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:47,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:01:47,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734262729] [2021-11-22 20:01:47,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:47,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:01:47,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:47,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:01:47,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:01:47,094 INFO L87 Difference]: Start difference. First operand 524 states and 614 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:47,486 INFO L93 Difference]: Finished difference Result 1082 states and 1276 transitions. [2021-11-22 20:01:47,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 20:01:47,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 20:01:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:47,490 INFO L225 Difference]: With dead ends: 1082 [2021-11-22 20:01:47,490 INFO L226 Difference]: Without dead ends: 685 [2021-11-22 20:01:47,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:01:47,491 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 587 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:47,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [587 Valid, 936 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:01:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-11-22 20:01:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 518. [2021-11-22 20:01:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 509 states have (on average 1.18664047151277) internal successors, (604), 517 states have internal predecessors, (604), 0 states have call successors, (0), 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-11-22 20:01:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 604 transitions. [2021-11-22 20:01:47,511 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 604 transitions. Word has length 62 [2021-11-22 20:01:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:47,511 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 604 transitions. [2021-11-22 20:01:47,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 604 transitions. [2021-11-22 20:01:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 20:01:47,512 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:47,512 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:47,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 20:01:47,513 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:47,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1187581333, now seen corresponding path program 1 times [2021-11-22 20:01:47,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:47,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136563368] [2021-11-22 20:01:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:47,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:47,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:47,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136563368] [2021-11-22 20:01:47,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136563368] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:47,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:47,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:01:47,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828420176] [2021-11-22 20:01:47,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:47,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:01:47,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:01:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:01:47,764 INFO L87 Difference]: Start difference. First operand 518 states and 604 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-22 20:01:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:48,539 INFO L93 Difference]: Finished difference Result 1350 states and 1569 transitions. [2021-11-22 20:01:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 20:01:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-11-22 20:01:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:48,542 INFO L225 Difference]: With dead ends: 1350 [2021-11-22 20:01:48,542 INFO L226 Difference]: Without dead ends: 1054 [2021-11-22 20:01:48,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2021-11-22 20:01:48,543 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 1442 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:48,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1442 Valid, 1997 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 20:01:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-11-22 20:01:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 416. [2021-11-22 20:01:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 407 states have (on average 1.1769041769041768) internal successors, (479), 415 states have internal predecessors, (479), 0 states have call successors, (0), 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-11-22 20:01:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 479 transitions. [2021-11-22 20:01:48,559 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 479 transitions. Word has length 63 [2021-11-22 20:01:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:48,560 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 479 transitions. [2021-11-22 20:01:48,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-22 20:01:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 479 transitions. [2021-11-22 20:01:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 20:01:48,560 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:48,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:48,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 20:01:48,561 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1069255249, now seen corresponding path program 1 times [2021-11-22 20:01:48,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:48,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170977447] [2021-11-22 20:01:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:48,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:48,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:48,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170977447] [2021-11-22 20:01:48,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170977447] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:48,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:48,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 20:01:48,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177279933] [2021-11-22 20:01:48,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:48,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 20:01:48,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:48,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 20:01:48,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:01:48,751 INFO L87 Difference]: Start difference. First operand 416 states and 479 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 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-11-22 20:01:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:49,881 INFO L93 Difference]: Finished difference Result 1176 states and 1356 transitions. [2021-11-22 20:01:49,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-22 20:01:49,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-11-22 20:01:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:49,883 INFO L225 Difference]: With dead ends: 1176 [2021-11-22 20:01:49,883 INFO L226 Difference]: Without dead ends: 952 [2021-11-22 20:01:49,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2021-11-22 20:01:49,885 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 1399 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:49,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1399 Valid, 1788 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 20:01:49,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2021-11-22 20:01:49,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 377. [2021-11-22 20:01:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 368 states have (on average 1.184782608695652) internal successors, (436), 376 states have internal predecessors, (436), 0 states have call successors, (0), 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-11-22 20:01:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 436 transitions. [2021-11-22 20:01:49,903 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 436 transitions. Word has length 64 [2021-11-22 20:01:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:49,903 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 436 transitions. [2021-11-22 20:01:49,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 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-11-22 20:01:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 436 transitions. [2021-11-22 20:01:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 20:01:49,904 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:49,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:49,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 20:01:49,905 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2016509576, now seen corresponding path program 1 times [2021-11-22 20:01:49,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:49,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072147941] [2021-11-22 20:01:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:49,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:50,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:50,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072147941] [2021-11-22 20:01:50,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072147941] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:50,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:50,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:01:50,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82067840] [2021-11-22 20:01:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:50,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:01:50,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:50,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:01:50,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:01:50,107 INFO L87 Difference]: Start difference. First operand 377 states and 436 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:50,398 INFO L93 Difference]: Finished difference Result 897 states and 1033 transitions. [2021-11-22 20:01:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:01:50,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-22 20:01:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:50,400 INFO L225 Difference]: With dead ends: 897 [2021-11-22 20:01:50,400 INFO L226 Difference]: Without dead ends: 543 [2021-11-22 20:01:50,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:01:50,401 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 617 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:50,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 1069 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:01:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-11-22 20:01:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 381. [2021-11-22 20:01:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 372 states have (on average 1.1827956989247312) internal successors, (440), 380 states have internal predecessors, (440), 0 states have call successors, (0), 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-11-22 20:01:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 440 transitions. [2021-11-22 20:01:50,415 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 440 transitions. Word has length 71 [2021-11-22 20:01:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:50,415 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 440 transitions. [2021-11-22 20:01:50,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 440 transitions. [2021-11-22 20:01:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 20:01:50,416 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:50,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:50,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 20:01:50,416 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:50,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash -922656660, now seen corresponding path program 1 times [2021-11-22 20:01:50,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:50,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338456208] [2021-11-22 20:01:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:50,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:50,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:50,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338456208] [2021-11-22 20:01:50,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338456208] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:50,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:50,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:01:50,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707000977] [2021-11-22 20:01:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:50,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:01:50,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:01:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:01:50,537 INFO L87 Difference]: Start difference. First operand 381 states and 440 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:50,610 INFO L93 Difference]: Finished difference Result 538 states and 625 transitions. [2021-11-22 20:01:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:01:50,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-22 20:01:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:50,612 INFO L225 Difference]: With dead ends: 538 [2021-11-22 20:01:50,612 INFO L226 Difference]: Without dead ends: 381 [2021-11-22 20:01:50,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:01:50,613 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 516 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:50,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 520 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:01:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-22 20:01:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-11-22 20:01:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 372 states have (on average 1.1774193548387097) internal successors, (438), 380 states have internal predecessors, (438), 0 states have call successors, (0), 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-11-22 20:01:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 438 transitions. [2021-11-22 20:01:50,625 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 438 transitions. Word has length 73 [2021-11-22 20:01:50,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:50,625 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 438 transitions. [2021-11-22 20:01:50,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 438 transitions. [2021-11-22 20:01:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-22 20:01:50,626 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:50,626 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:50,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 20:01:50,627 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:50,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1468434995, now seen corresponding path program 1 times [2021-11-22 20:01:50,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:50,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651142170] [2021-11-22 20:01:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:50,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:51,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:51,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651142170] [2021-11-22 20:01:51,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651142170] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:51,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:51,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 20:01:51,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519765540] [2021-11-22 20:01:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:51,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 20:01:51,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:51,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 20:01:51,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:01:51,086 INFO L87 Difference]: Start difference. First operand 381 states and 438 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:52,139 INFO L93 Difference]: Finished difference Result 1182 states and 1366 transitions. [2021-11-22 20:01:52,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 20:01:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-22 20:01:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:52,142 INFO L225 Difference]: With dead ends: 1182 [2021-11-22 20:01:52,142 INFO L226 Difference]: Without dead ends: 843 [2021-11-22 20:01:52,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=481, Unknown=0, NotChecked=0, Total=702 [2021-11-22 20:01:52,143 INFO L933 BasicCegarLoop]: 524 mSDtfsCounter, 1038 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:52,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1038 Valid, 1711 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 20:01:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-11-22 20:01:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 381. [2021-11-22 20:01:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 372 states have (on average 1.174731182795699) internal successors, (437), 380 states have internal predecessors, (437), 0 states have call successors, (0), 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-11-22 20:01:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 437 transitions. [2021-11-22 20:01:52,162 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 437 transitions. Word has length 74 [2021-11-22 20:01:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:52,162 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 437 transitions. [2021-11-22 20:01:52,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 437 transitions. [2021-11-22 20:01:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 20:01:52,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:52,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:52,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 20:01:52,165 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1698063400, now seen corresponding path program 1 times [2021-11-22 20:01:52,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:52,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410720044] [2021-11-22 20:01:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:52,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:52,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:52,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410720044] [2021-11-22 20:01:52,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410720044] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:52,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:52,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 20:01:52,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663389847] [2021-11-22 20:01:52,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:52,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 20:01:52,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:52,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 20:01:52,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:01:52,720 INFO L87 Difference]: Start difference. First operand 381 states and 437 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:54,175 INFO L93 Difference]: Finished difference Result 967 states and 1102 transitions. [2021-11-22 20:01:54,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-22 20:01:54,175 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-22 20:01:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:54,177 INFO L225 Difference]: With dead ends: 967 [2021-11-22 20:01:54,177 INFO L226 Difference]: Without dead ends: 797 [2021-11-22 20:01:54,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=595, Invalid=1757, Unknown=0, NotChecked=0, Total=2352 [2021-11-22 20:01:54,179 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 1757 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:54,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1757 Valid, 3134 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 20:01:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-11-22 20:01:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 520. [2021-11-22 20:01:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 511 states have (on average 1.1917808219178083) internal successors, (609), 519 states have internal predecessors, (609), 0 states have call successors, (0), 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-11-22 20:01:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 609 transitions. [2021-11-22 20:01:54,207 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 609 transitions. Word has length 77 [2021-11-22 20:01:54,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:54,208 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 609 transitions. [2021-11-22 20:01:54,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 609 transitions. [2021-11-22 20:01:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 20:01:54,209 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:54,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:54,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 20:01:54,209 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:54,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:54,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1018005030, now seen corresponding path program 1 times [2021-11-22 20:01:54,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:54,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48965370] [2021-11-22 20:01:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:54,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:54,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:54,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48965370] [2021-11-22 20:01:54,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48965370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:54,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:54,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:01:54,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489797533] [2021-11-22 20:01:54,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:54,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:01:54,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:54,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:01:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:01:54,353 INFO L87 Difference]: Start difference. First operand 520 states and 609 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:54,604 INFO L93 Difference]: Finished difference Result 1014 states and 1187 transitions. [2021-11-22 20:01:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:01:54,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-22 20:01:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:54,606 INFO L225 Difference]: With dead ends: 1014 [2021-11-22 20:01:54,606 INFO L226 Difference]: Without dead ends: 522 [2021-11-22 20:01:54,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:01:54,607 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 92 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:54,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 380 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:01:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-11-22 20:01:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 516. [2021-11-22 20:01:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 507 states have (on average 1.1420118343195267) internal successors, (579), 515 states have internal predecessors, (579), 0 states have call successors, (0), 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-11-22 20:01:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 579 transitions. [2021-11-22 20:01:54,627 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 579 transitions. Word has length 77 [2021-11-22 20:01:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:54,627 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 579 transitions. [2021-11-22 20:01:54,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 579 transitions. [2021-11-22 20:01:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-22 20:01:54,628 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:54,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:54,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 20:01:54,629 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2020332895, now seen corresponding path program 1 times [2021-11-22 20:01:54,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:54,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356861181] [2021-11-22 20:01:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:54,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:54,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:54,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356861181] [2021-11-22 20:01:54,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356861181] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:54,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:54,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 20:01:54,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022780748] [2021-11-22 20:01:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:54,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 20:01:54,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:54,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 20:01:54,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:01:54,868 INFO L87 Difference]: Start difference. First operand 516 states and 579 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:56,217 INFO L93 Difference]: Finished difference Result 1048 states and 1169 transitions. [2021-11-22 20:01:56,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-22 20:01:56,220 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-22 20:01:56,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:56,222 INFO L225 Difference]: With dead ends: 1048 [2021-11-22 20:01:56,222 INFO L226 Difference]: Without dead ends: 840 [2021-11-22 20:01:56,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2021-11-22 20:01:56,223 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 1373 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:56,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1373 Valid, 1887 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 20:01:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-11-22 20:01:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 568. [2021-11-22 20:01:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 559 states have (on average 1.1323792486583184) internal successors, (633), 567 states have internal predecessors, (633), 0 states have call successors, (0), 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-11-22 20:01:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 633 transitions. [2021-11-22 20:01:56,251 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 633 transitions. Word has length 79 [2021-11-22 20:01:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:56,251 INFO L470 AbstractCegarLoop]: Abstraction has 568 states and 633 transitions. [2021-11-22 20:01:56,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 633 transitions. [2021-11-22 20:01:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-22 20:01:56,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:56,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:56,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 20:01:56,253 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash 556390545, now seen corresponding path program 1 times [2021-11-22 20:01:56,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:56,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457885353] [2021-11-22 20:01:56,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:56,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:56,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:56,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457885353] [2021-11-22 20:01:56,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457885353] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:56,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:56,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 20:01:56,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847532444] [2021-11-22 20:01:56,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:56,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 20:01:56,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:56,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 20:01:56,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:01:56,429 INFO L87 Difference]: Start difference. First operand 568 states and 633 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:57,569 INFO L93 Difference]: Finished difference Result 1042 states and 1155 transitions. [2021-11-22 20:01:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 20:01:57,570 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-22 20:01:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:57,593 INFO L225 Difference]: With dead ends: 1042 [2021-11-22 20:01:57,593 INFO L226 Difference]: Without dead ends: 1026 [2021-11-22 20:01:57,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-22 20:01:57,594 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 692 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:57,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 1188 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 20:01:57,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-11-22 20:01:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 575. [2021-11-22 20:01:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 566 states have (on average 1.127208480565371) internal successors, (638), 574 states have internal predecessors, (638), 0 states have call successors, (0), 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-11-22 20:01:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 638 transitions. [2021-11-22 20:01:57,625 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 638 transitions. Word has length 79 [2021-11-22 20:01:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:57,625 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 638 transitions. [2021-11-22 20:01:57,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 638 transitions. [2021-11-22 20:01:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-22 20:01:57,627 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:57,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:01:57,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 20:01:57,627 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:57,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1522373004, now seen corresponding path program 1 times [2021-11-22 20:01:57,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:57,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513655523] [2021-11-22 20:01:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:57,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:57,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:57,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513655523] [2021-11-22 20:01:57,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513655523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:01:57,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:01:57,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:01:57,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742963373] [2021-11-22 20:01:57,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:01:57,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:01:57,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:01:57,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:01:57,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:01:57,717 INFO L87 Difference]: Start difference. First operand 575 states and 638 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:01:57,781 INFO L93 Difference]: Finished difference Result 743 states and 827 transitions. [2021-11-22 20:01:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:01:57,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-22 20:01:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:01:57,783 INFO L225 Difference]: With dead ends: 743 [2021-11-22 20:01:57,784 INFO L226 Difference]: Without dead ends: 575 [2021-11-22 20:01:57,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-22 20:01:57,785 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 136 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:01:57,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 518 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:01:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-11-22 20:01:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2021-11-22 20:01:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 566 states have (on average 1.1219081272084805) internal successors, (635), 574 states have internal predecessors, (635), 0 states have call successors, (0), 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-11-22 20:01:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 635 transitions. [2021-11-22 20:01:57,812 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 635 transitions. Word has length 80 [2021-11-22 20:01:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:01:57,812 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 635 transitions. [2021-11-22 20:01:57,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:01:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 635 transitions. [2021-11-22 20:01:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-22 20:01:57,813 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:01:57,813 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:01:57,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 20:01:57,813 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:01:57,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:01:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1322591582, now seen corresponding path program 1 times [2021-11-22 20:01:57,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:01:57,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164983419] [2021-11-22 20:01:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:57,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:01:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:58,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:01:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164983419] [2021-11-22 20:01:58,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164983419] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:01:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479492623] [2021-11-22 20:01:58,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:01:58,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:01:58,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:01:58,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:01:58,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 20:01:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:01:58,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 2720 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-22 20:01:58,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:01:58,897 INFO L388 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-11-22 20:01:58,975 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:01:58,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-22 20:01:59,063 INFO L388 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 21 treesize of output 17 [2021-11-22 20:01:59,224 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-22 20:01:59,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-22 20:01:59,267 INFO L388 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 23 treesize of output 23 [2021-11-22 20:01:59,293 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:01:59,294 INFO L388 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 27 treesize of output 27 [2021-11-22 20:01:59,546 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-11-22 20:01:59,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 49 [2021-11-22 20:01:59,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-22 20:01:59,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-11-22 20:01:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:01:59,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:02:01,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_9| Int) (v_ArrVal_657 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_656))) (let ((.cse2 (select .cse0 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_9|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse1) (select .cse2 8))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_9| (let ((.cse3 (store .cse2 0 v_ArrVal_657))) (store .cse3 8 (select .cse3 8)))) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse1) 0)))))) is different from false [2021-11-22 20:02:01,782 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:01,783 INFO L388 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 74 [2021-11-22 20:02:01,795 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:01,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 381 treesize of output 381 [2021-11-22 20:02:01,808 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:01,809 INFO L388 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 889 treesize of output 811 [2021-11-22 20:02:02,044 INFO L388 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 8 treesize of output 4 [2021-11-22 20:02:02,089 INFO L388 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 8 treesize of output 4 [2021-11-22 20:02:02,105 INFO L388 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 8 treesize of output 4 [2021-11-22 20:02:02,121 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:02,122 INFO L388 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 26 treesize of output 30 [2021-11-22 20:02:02,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:02,193 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:02:02,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 67 [2021-11-22 20:02:02,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:02,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:02,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:02,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:02,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2021-11-22 20:02:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:02,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479492623] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:02:02,809 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:02:02,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 37 [2021-11-22 20:02:02,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202490652] [2021-11-22 20:02:02,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:02:02,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-22 20:02:02,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:02,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-22 20:02:02,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1116, Unknown=8, NotChecked=68, Total=1332 [2021-11-22 20:02:02,811 INFO L87 Difference]: Start difference. First operand 575 states and 635 transitions. Second operand has 37 states, 37 states have (on average 5.621621621621622) internal successors, (208), 37 states have internal predecessors, (208), 0 states have call successors, (0), 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-11-22 20:02:03,161 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|))) (let ((.cse0 (select .cse2 8)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) (.cse3 (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|))) (and (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse0)) (not (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_bounded_malloc_#res#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8)) 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse1) 0) (= |c_ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= (select .cse2 .cse1) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |c_ULTIMATE.start_bounded_malloc_#res#1.base|)) (= |c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= .cse3 1) (not (= .cse3 0)) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (= |c_ULTIMATE.start_save_byte_from_array_~array#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0) (forall ((v_ArrVal_656 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_9| Int) (v_ArrVal_657 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_656))) (let ((.cse6 (select .cse4 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_9|)) (.cse5 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (or (not (= (select (select .cse4 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse5) (select .cse6 8))) (not (= (select (select (store .cse4 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_9| (let ((.cse7 (store .cse6 0 v_ArrVal_657))) (store .cse7 8 (select .cse7 8)))) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse5) 0))))))))) is different from false [2021-11-22 20:02:03,178 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|))) (let ((.cse1 (select .cse0 8))) (and (not (= (select .cse0 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse1)) (not (= .cse1 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) 0)) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0) (forall ((v_ArrVal_656 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_9| Int) (v_ArrVal_657 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_656))) (let ((.cse4 (select .cse2 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_9|)) (.cse3 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (or (not (= (select (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse3) (select .cse4 8))) (not (= (select (select (store .cse2 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_9| (let ((.cse5 (store .cse4 0 v_ArrVal_657))) (store .cse5 8 (select .cse5 8)))) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse3) 0))))))))) is different from false [2021-11-22 20:02:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:04,086 INFO L93 Difference]: Finished difference Result 1143 states and 1263 transitions. [2021-11-22 20:02:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-22 20:02:04,087 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.621621621621622) internal successors, (208), 37 states have internal predecessors, (208), 0 states have call successors, (0), 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 80 [2021-11-22 20:02:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:04,089 INFO L225 Difference]: With dead ends: 1143 [2021-11-22 20:02:04,089 INFO L226 Difference]: Without dead ends: 864 [2021-11-22 20:02:04,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=428, Invalid=2880, Unknown=10, NotChecked=342, Total=3660 [2021-11-22 20:02:04,090 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 792 mSDsluCounter, 5707 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 6052 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1009 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:04,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [792 Valid, 6052 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1229 Invalid, 0 Unknown, 1009 Unchecked, 0.6s Time] [2021-11-22 20:02:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2021-11-22 20:02:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 582. [2021-11-22 20:02:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 573 states have (on average 1.1221640488656195) internal successors, (643), 581 states have internal predecessors, (643), 0 states have call successors, (0), 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-11-22 20:02:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 643 transitions. [2021-11-22 20:02:04,118 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 643 transitions. Word has length 80 [2021-11-22 20:02:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:04,118 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 643 transitions. [2021-11-22 20:02:04,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.621621621621622) internal successors, (208), 37 states have internal predecessors, (208), 0 states have call successors, (0), 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-11-22 20:02:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 643 transitions. [2021-11-22 20:02:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 20:02:04,119 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:04,119 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:04,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 20:02:04,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-22 20:02:04,335 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash 270285312, now seen corresponding path program 1 times [2021-11-22 20:02:04,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:04,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327989782] [2021-11-22 20:02:04,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:04,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:04,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:04,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327989782] [2021-11-22 20:02:04,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327989782] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:04,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:04,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 20:02:04,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595552808] [2021-11-22 20:02:04,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:04,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:02:04,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:02:04,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:02:04,421 INFO L87 Difference]: Start difference. First operand 582 states and 643 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-22 20:02:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:04,450 INFO L93 Difference]: Finished difference Result 719 states and 799 transitions. [2021-11-22 20:02:04,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:02:04,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-11-22 20:02:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:04,452 INFO L225 Difference]: With dead ends: 719 [2021-11-22 20:02:04,452 INFO L226 Difference]: Without dead ends: 586 [2021-11-22 20:02:04,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-22 20:02:04,453 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:04,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 476 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:02:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-11-22 20:02:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2021-11-22 20:02:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 577 states have (on average 1.1213171577123051) internal successors, (647), 585 states have internal predecessors, (647), 0 states have call successors, (0), 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-11-22 20:02:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 647 transitions. [2021-11-22 20:02:04,483 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 647 transitions. Word has length 82 [2021-11-22 20:02:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:04,483 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 647 transitions. [2021-11-22 20:02:04,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-22 20:02:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 647 transitions. [2021-11-22 20:02:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 20:02:04,484 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:04,484 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:04,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 20:02:04,484 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1332901116, now seen corresponding path program 1 times [2021-11-22 20:02:04,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:04,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229649526] [2021-11-22 20:02:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:04,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:02:04,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:04,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229649526] [2021-11-22 20:02:04,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229649526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:04,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:04,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 20:02:04,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243354217] [2021-11-22 20:02:04,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:04,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 20:02:04,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:04,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 20:02:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:02:04,742 INFO L87 Difference]: Start difference. First operand 586 states and 647 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:02:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:05,566 INFO L93 Difference]: Finished difference Result 897 states and 986 transitions. [2021-11-22 20:02:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 20:02:05,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 20:02:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:05,568 INFO L225 Difference]: With dead ends: 897 [2021-11-22 20:02:05,568 INFO L226 Difference]: Without dead ends: 705 [2021-11-22 20:02:05,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2021-11-22 20:02:05,569 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 1012 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:05,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1012 Valid, 1782 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 20:02:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-11-22 20:02:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 583. [2021-11-22 20:02:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 574 states have (on average 1.1184668989547037) internal successors, (642), 582 states have internal predecessors, (642), 0 states have call successors, (0), 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-11-22 20:02:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 642 transitions. [2021-11-22 20:02:05,607 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 642 transitions. Word has length 84 [2021-11-22 20:02:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:05,607 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 642 transitions. [2021-11-22 20:02:05,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:02:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 642 transitions. [2021-11-22 20:02:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 20:02:05,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:05,608 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:05,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-22 20:02:05,620 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1962318348, now seen corresponding path program 2 times [2021-11-22 20:02:05,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:05,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721096923] [2021-11-22 20:02:05,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:05,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 20:02:06,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:06,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721096923] [2021-11-22 20:02:06,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721096923] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:02:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439557412] [2021-11-22 20:02:06,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 20:02:06,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:02:06,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:02:06,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:02:06,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 20:02:07,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 20:02:07,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 20:02:07,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 2780 conjuncts, 100 conjunts are in the unsatisfiable core [2021-11-22 20:02:07,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:02:07,664 INFO L388 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-11-22 20:02:07,774 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:02:07,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 20:02:07,816 INFO L388 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 11 treesize of output 7 [2021-11-22 20:02:07,907 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:02:07,907 INFO L388 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-11-22 20:02:07,939 INFO L388 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 16 treesize of output 18 [2021-11-22 20:02:07,961 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:02:07,961 INFO L388 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 20 treesize of output 22 [2021-11-22 20:02:08,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:08,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2021-11-22 20:02:08,333 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-22 20:02:08,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 55 [2021-11-22 20:02:08,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:08,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:08,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-11-22 20:02:08,417 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-11-22 20:02:08,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 49 [2021-11-22 20:02:08,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-11-22 20:02:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:02:08,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:02:09,093 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:09,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 266 [2021-11-22 20:02:09,119 INFO L388 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 7 treesize of output 3 [2021-11-22 20:02:09,289 INFO L388 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 10 treesize of output 8 [2021-11-22 20:02:09,308 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:09,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 65 [2021-11-22 20:02:09,471 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) 0)) (forall ((v_ArrVal_860 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_860) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0))) is different from false [2021-11-22 20:02:09,730 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:09,731 INFO L388 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 36 treesize of output 36 [2021-11-22 20:02:09,737 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:09,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 50 treesize of output 53 [2021-11-22 20:02:09,739 INFO L388 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 49 treesize of output 45 [2021-11-22 20:02:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:02:10,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439557412] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:02:10,427 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:02:10,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 42 [2021-11-22 20:02:10,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705218318] [2021-11-22 20:02:10,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:02:10,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-22 20:02:10,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-22 20:02:10,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1486, Unknown=4, NotChecked=78, Total=1722 [2021-11-22 20:02:10,430 INFO L87 Difference]: Start difference. First operand 583 states and 642 transitions. Second operand has 42 states, 42 states have (on average 4.309523809523809) internal successors, (181), 42 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:02:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:12,226 INFO L93 Difference]: Finished difference Result 980 states and 1078 transitions. [2021-11-22 20:02:12,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-22 20:02:12,226 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.309523809523809) internal successors, (181), 42 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 20:02:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:12,229 INFO L225 Difference]: With dead ends: 980 [2021-11-22 20:02:12,229 INFO L226 Difference]: Without dead ends: 802 [2021-11-22 20:02:12,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 146 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=502, Invalid=3658, Unknown=4, NotChecked=126, Total=4290 [2021-11-22 20:02:12,230 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 1313 mSDsluCounter, 5713 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 6039 SdHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 908 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:12,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1313 Valid, 6039 Invalid, 2790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1838 Invalid, 0 Unknown, 908 Unchecked, 0.9s Time] [2021-11-22 20:02:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2021-11-22 20:02:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 618. [2021-11-22 20:02:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 610 states have (on average 1.1213114754098361) internal successors, (684), 617 states have internal predecessors, (684), 0 states have call successors, (0), 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-11-22 20:02:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 684 transitions. [2021-11-22 20:02:12,269 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 684 transitions. Word has length 85 [2021-11-22 20:02:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:12,269 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 684 transitions. [2021-11-22 20:02:12,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.309523809523809) internal successors, (181), 42 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:02:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 684 transitions. [2021-11-22 20:02:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-22 20:02:12,270 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:12,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:02:12,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-22 20:02:12,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-22 20:02:12,494 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash -865898561, now seen corresponding path program 1 times [2021-11-22 20:02:12,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414755163] [2021-11-22 20:02:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:12,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:12,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:12,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414755163] [2021-11-22 20:02:12,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414755163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:12,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:12,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 20:02:12,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492428813] [2021-11-22 20:02:12,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:12,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 20:02:12,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 20:02:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:02:12,777 INFO L87 Difference]: Start difference. First operand 618 states and 684 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:02:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:14,005 INFO L93 Difference]: Finished difference Result 854 states and 931 transitions. [2021-11-22 20:02:14,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-22 20:02:14,006 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-11-22 20:02:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:14,007 INFO L225 Difference]: With dead ends: 854 [2021-11-22 20:02:14,007 INFO L226 Difference]: Without dead ends: 775 [2021-11-22 20:02:14,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2021-11-22 20:02:14,008 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 915 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:14,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [915 Valid, 1825 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 20:02:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-11-22 20:02:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 625. [2021-11-22 20:02:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 617 states have (on average 1.119935170178282) internal successors, (691), 624 states have internal predecessors, (691), 0 states have call successors, (0), 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-11-22 20:02:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 691 transitions. [2021-11-22 20:02:14,036 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 691 transitions. Word has length 86 [2021-11-22 20:02:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:14,036 INFO L470 AbstractCegarLoop]: Abstraction has 625 states and 691 transitions. [2021-11-22 20:02:14,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:02:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 691 transitions. [2021-11-22 20:02:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 20:02:14,038 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:14,038 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:14,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 20:02:14,038 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2114055575, now seen corresponding path program 1 times [2021-11-22 20:02:14,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:14,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404563799] [2021-11-22 20:02:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:14,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:02:14,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:14,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404563799] [2021-11-22 20:02:14,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404563799] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:14,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:14,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:02:14,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811928183] [2021-11-22 20:02:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:14,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:02:14,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:14,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:02:14,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:02:14,177 INFO L87 Difference]: Start difference. First operand 625 states and 691 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:02:14,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:14,485 INFO L93 Difference]: Finished difference Result 947 states and 1048 transitions. [2021-11-22 20:02:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:02:14,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-22 20:02:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:14,487 INFO L225 Difference]: With dead ends: 947 [2021-11-22 20:02:14,487 INFO L226 Difference]: Without dead ends: 693 [2021-11-22 20:02:14,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:02:14,488 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 62 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:14,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 686 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:02:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-11-22 20:02:14,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 641. [2021-11-22 20:02:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 633 states have (on average 1.1184834123222749) internal successors, (708), 640 states have internal predecessors, (708), 0 states have call successors, (0), 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-11-22 20:02:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 708 transitions. [2021-11-22 20:02:14,516 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 708 transitions. Word has length 87 [2021-11-22 20:02:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:14,517 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 708 transitions. [2021-11-22 20:02:14,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:02:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 708 transitions. [2021-11-22 20:02:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-22 20:02:14,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:14,518 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:14,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-22 20:02:14,518 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:14,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:14,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1944199027, now seen corresponding path program 1 times [2021-11-22 20:02:14,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:14,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333803305] [2021-11-22 20:02:14,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:14,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:15,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:15,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333803305] [2021-11-22 20:02:15,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333803305] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:02:15,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037088381] [2021-11-22 20:02:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:15,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:02:15,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:02:15,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:02:15,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 20:02:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:15,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 85 conjunts are in the unsatisfiable core [2021-11-22 20:02:15,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:02:15,483 INFO L388 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-11-22 20:02:15,587 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:02:15,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 20:02:15,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 20:02:15,811 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:02:15,812 INFO L388 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-11-22 20:02:15,842 INFO L388 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 16 treesize of output 18 [2021-11-22 20:02:15,859 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:02:15,859 INFO L388 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 20 treesize of output 22 [2021-11-22 20:02:16,198 INFO L354 Elim1Store]: treesize reduction 27, result has 40.0 percent of original size [2021-11-22 20:02:16,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 50 treesize of output 56 [2021-11-22 20:02:16,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:16,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:16,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:16,247 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2021-11-22 20:02:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:16,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:02:16,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_13| Int) (v_ArrVal_1050 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_1050))) (let ((.cse0 (select .cse1 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_13|))) (or (not (= (select .cse0 8) (select (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)))) (not (= (+ (select (store .cse0 0 v_ArrVal_1051) 8) 1) 0)))))) is different from false [2021-11-22 20:02:17,169 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:17,169 INFO L388 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 73 treesize of output 53 [2021-11-22 20:02:17,179 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:17,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 141 [2021-11-22 20:02:17,184 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:17,185 INFO L388 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 138 treesize of output 134 [2021-11-22 20:02:17,288 INFO L388 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 8 treesize of output 4 [2021-11-22 20:02:17,337 INFO L388 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 10 treesize of output 6 [2021-11-22 20:02:17,344 INFO L388 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 8 treesize of output 4 [2021-11-22 20:02:17,367 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:17,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 72 [2021-11-22 20:02:17,447 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:17,448 INFO L388 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 24 treesize of output 28 [2021-11-22 20:02:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:17,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037088381] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:02:17,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:02:17,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 46 [2021-11-22 20:02:17,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080447218] [2021-11-22 20:02:17,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:02:17,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-22 20:02:17,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:17,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-22 20:02:17,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1814, Unknown=7, NotChecked=86, Total=2070 [2021-11-22 20:02:17,828 INFO L87 Difference]: Start difference. First operand 641 states and 708 transitions. Second operand has 46 states, 46 states have (on average 5.456521739130435) internal successors, (251), 46 states have internal predecessors, (251), 0 states have call successors, (0), 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-11-22 20:02:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:22,111 INFO L93 Difference]: Finished difference Result 1298 states and 1441 transitions. [2021-11-22 20:02:22,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-22 20:02:22,112 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.456521739130435) internal successors, (251), 46 states have internal predecessors, (251), 0 states have call successors, (0), 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 89 [2021-11-22 20:02:22,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:22,114 INFO L225 Difference]: With dead ends: 1298 [2021-11-22 20:02:22,114 INFO L226 Difference]: Without dead ends: 825 [2021-11-22 20:02:22,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2139 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1146, Invalid=8356, Unknown=8, NotChecked=192, Total=9702 [2021-11-22 20:02:22,118 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 823 mSDsluCounter, 6418 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 6790 SdHoareTripleChecker+Invalid, 3768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1217 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:22,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [823 Valid, 6790 Invalid, 3768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2410 Invalid, 0 Unknown, 1217 Unchecked, 1.3s Time] [2021-11-22 20:02:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-11-22 20:02:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 589. [2021-11-22 20:02:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 581 states have (on average 1.1204819277108433) internal successors, (651), 588 states have internal predecessors, (651), 0 states have call successors, (0), 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-11-22 20:02:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 651 transitions. [2021-11-22 20:02:22,147 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 651 transitions. Word has length 89 [2021-11-22 20:02:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:22,148 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 651 transitions. [2021-11-22 20:02:22,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.456521739130435) internal successors, (251), 46 states have internal predecessors, (251), 0 states have call successors, (0), 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-11-22 20:02:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 651 transitions. [2021-11-22 20:02:22,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-22 20:02:22,149 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:22,149 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:02:22,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 20:02:22,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:02:22,363 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:22,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:22,364 INFO L85 PathProgramCache]: Analyzing trace with hash -762517494, now seen corresponding path program 1 times [2021-11-22 20:02:22,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:22,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742559184] [2021-11-22 20:02:22,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:22,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:22,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:22,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742559184] [2021-11-22 20:02:22,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742559184] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:22,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:22,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:02:22,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125088518] [2021-11-22 20:02:22,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:22,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:02:22,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:22,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:02:22,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:02:22,466 INFO L87 Difference]: Start difference. First operand 589 states and 651 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11-22 20:02:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:22,545 INFO L93 Difference]: Finished difference Result 658 states and 727 transitions. [2021-11-22 20:02:22,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:02:22,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-11-22 20:02:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:22,547 INFO L225 Difference]: With dead ends: 658 [2021-11-22 20:02:22,547 INFO L226 Difference]: Without dead ends: 589 [2021-11-22 20:02:22,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-22 20:02:22,548 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 162 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:22,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 462 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:02:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-11-22 20:02:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2021-11-22 20:02:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 581 states have (on average 1.1153184165232357) internal successors, (648), 588 states have internal predecessors, (648), 0 states have call successors, (0), 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-11-22 20:02:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 648 transitions. [2021-11-22 20:02:22,575 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 648 transitions. Word has length 95 [2021-11-22 20:02:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:22,575 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 648 transitions. [2021-11-22 20:02:22,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11-22 20:02:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 648 transitions. [2021-11-22 20:02:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 20:02:22,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:22,576 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:22,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 20:02:22,577 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:22,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:22,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2083345997, now seen corresponding path program 2 times [2021-11-22 20:02:22,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:22,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910448194] [2021-11-22 20:02:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:22,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:23,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:23,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910448194] [2021-11-22 20:02:23,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910448194] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:02:23,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625749167] [2021-11-22 20:02:23,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 20:02:23,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:02:23,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:02:23,507 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:02:23,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 20:02:25,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 20:02:25,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 20:02:25,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 2889 conjuncts, 110 conjunts are in the unsatisfiable core [2021-11-22 20:02:25,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:02:25,135 INFO L388 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-11-22 20:02:25,236 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:02:25,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-22 20:02:25,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 20:02:25,437 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:02:25,438 INFO L388 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-11-22 20:02:25,477 INFO L388 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 16 treesize of output 18 [2021-11-22 20:02:25,497 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:02:25,497 INFO L388 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 20 treesize of output 22 [2021-11-22 20:02:25,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:25,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2021-11-22 20:02:25,970 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-22 20:02:25,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 55 [2021-11-22 20:02:26,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:26,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:26,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:26,069 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2021-11-22 20:02:26,133 INFO L388 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 0 case distinctions, treesize of input 36 treesize of output 29 [2021-11-22 20:02:26,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:26,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:26,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-22 20:02:26,168 INFO L388 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 0 case distinctions, treesize of input 36 treesize of output 29 [2021-11-22 20:02:26,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:26,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:26,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-11-22 20:02:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-22 20:02:26,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:02:26,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625749167] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:26,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 20:02:26,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [22] total 41 [2021-11-22 20:02:26,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107795932] [2021-11-22 20:02:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:26,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-22 20:02:26,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:26,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-22 20:02:26,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1520, Unknown=0, NotChecked=0, Total=1640 [2021-11-22 20:02:26,366 INFO L87 Difference]: Start difference. First operand 589 states and 648 transitions. Second operand has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:02:28,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:28,781 INFO L93 Difference]: Finished difference Result 1020 states and 1111 transitions. [2021-11-22 20:02:28,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-22 20:02:28,782 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-22 20:02:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:28,784 INFO L225 Difference]: With dead ends: 1020 [2021-11-22 20:02:28,784 INFO L226 Difference]: Without dead ends: 776 [2021-11-22 20:02:28,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=761, Invalid=5245, Unknown=0, NotChecked=0, Total=6006 [2021-11-22 20:02:28,786 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 1599 mSDsluCounter, 3065 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:28,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1599 Valid, 3367 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1640 Invalid, 0 Unknown, 2 Unchecked, 0.8s Time] [2021-11-22 20:02:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2021-11-22 20:02:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 461. [2021-11-22 20:02:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 454 states have (on average 1.105726872246696) internal successors, (502), 460 states have internal predecessors, (502), 0 states have call successors, (0), 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-11-22 20:02:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 502 transitions. [2021-11-22 20:02:28,811 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 502 transitions. Word has length 99 [2021-11-22 20:02:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:28,811 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 502 transitions. [2021-11-22 20:02:28,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:02:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 502 transitions. [2021-11-22 20:02:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 20:02:28,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:28,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:28,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-22 20:02:29,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:02:29,042 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:29,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:29,042 INFO L85 PathProgramCache]: Analyzing trace with hash -202652931, now seen corresponding path program 1 times [2021-11-22 20:02:29,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:29,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038048064] [2021-11-22 20:02:29,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:29,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:29,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:29,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038048064] [2021-11-22 20:02:29,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038048064] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:29,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:29,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 20:02:29,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991323062] [2021-11-22 20:02:29,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:29,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 20:02:29,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:29,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 20:02:29,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:02:29,362 INFO L87 Difference]: Start difference. First operand 461 states and 502 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 0 states have call successors, (0), 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-11-22 20:02:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:30,552 INFO L93 Difference]: Finished difference Result 591 states and 637 transitions. [2021-11-22 20:02:30,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-22 20:02:30,553 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2021-11-22 20:02:30,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:30,554 INFO L225 Difference]: With dead ends: 591 [2021-11-22 20:02:30,554 INFO L226 Difference]: Without dead ends: 540 [2021-11-22 20:02:30,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=335, Invalid=1147, Unknown=0, NotChecked=0, Total=1482 [2021-11-22 20:02:30,555 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 849 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:30,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 1907 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 20:02:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-11-22 20:02:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 450. [2021-11-22 20:02:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 443 states have (on average 1.1015801354401806) internal successors, (488), 449 states have internal predecessors, (488), 0 states have call successors, (0), 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-11-22 20:02:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 488 transitions. [2021-11-22 20:02:30,578 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 488 transitions. Word has length 101 [2021-11-22 20:02:30,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:30,579 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 488 transitions. [2021-11-22 20:02:30,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 0 states have call successors, (0), 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-11-22 20:02:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 488 transitions. [2021-11-22 20:02:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-22 20:02:30,580 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:30,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:30,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-22 20:02:30,580 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1167371242, now seen corresponding path program 1 times [2021-11-22 20:02:30,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:30,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318109691] [2021-11-22 20:02:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:30,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:30,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:30,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318109691] [2021-11-22 20:02:30,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318109691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:30,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:30,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:02:30,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869701919] [2021-11-22 20:02:30,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:30,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:02:30,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:30,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:02:30,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:02:30,684 INFO L87 Difference]: Start difference. First operand 450 states and 488 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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-11-22 20:02:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:30,742 INFO L93 Difference]: Finished difference Result 461 states and 498 transitions. [2021-11-22 20:02:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:02:30,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2021-11-22 20:02:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:30,743 INFO L225 Difference]: With dead ends: 461 [2021-11-22 20:02:30,743 INFO L226 Difference]: Without dead ends: 450 [2021-11-22 20:02:30,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-22 20:02:30,745 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 218 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:30,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 346 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:02:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-11-22 20:02:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2021-11-22 20:02:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 443 states have (on average 1.0993227990970655) internal successors, (487), 449 states have internal predecessors, (487), 0 states have call successors, (0), 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-11-22 20:02:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 487 transitions. [2021-11-22 20:02:30,768 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 487 transitions. Word has length 110 [2021-11-22 20:02:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:30,768 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 487 transitions. [2021-11-22 20:02:30,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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-11-22 20:02:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 487 transitions. [2021-11-22 20:02:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-22 20:02:30,769 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:30,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:30,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-22 20:02:30,770 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:30,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:30,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2124819085, now seen corresponding path program 1 times [2021-11-22 20:02:30,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:30,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374143463] [2021-11-22 20:02:30,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:30,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:30,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:30,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374143463] [2021-11-22 20:02:30,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374143463] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:30,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:30,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:02:30,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000031254] [2021-11-22 20:02:30,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:30,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:02:30,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:30,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:02:30,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:02:30,987 INFO L87 Difference]: Start difference. First operand 450 states and 487 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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-11-22 20:02:31,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:31,457 INFO L93 Difference]: Finished difference Result 874 states and 952 transitions. [2021-11-22 20:02:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 20:02:31,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2021-11-22 20:02:31,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:31,460 INFO L225 Difference]: With dead ends: 874 [2021-11-22 20:02:31,460 INFO L226 Difference]: Without dead ends: 638 [2021-11-22 20:02:31,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-22 20:02:31,461 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 347 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:31,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 1263 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 20:02:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-11-22 20:02:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 466. [2021-11-22 20:02:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 459 states have (on average 1.0958605664488017) internal successors, (503), 465 states have internal predecessors, (503), 0 states have call successors, (0), 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-11-22 20:02:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 503 transitions. [2021-11-22 20:02:31,517 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 503 transitions. Word has length 111 [2021-11-22 20:02:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:31,517 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 503 transitions. [2021-11-22 20:02:31,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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-11-22 20:02:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 503 transitions. [2021-11-22 20:02:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-22 20:02:31,529 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:31,529 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:31,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-22 20:02:31,529 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:31,530 INFO L85 PathProgramCache]: Analyzing trace with hash 999031646, now seen corresponding path program 1 times [2021-11-22 20:02:31,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:31,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143004486] [2021-11-22 20:02:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:31,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 20:02:31,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:31,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143004486] [2021-11-22 20:02:31,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143004486] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:31,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:31,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:02:31,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908446994] [2021-11-22 20:02:31,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:31,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:02:31,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:31,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:02:31,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:02:31,848 INFO L87 Difference]: Start difference. First operand 466 states and 503 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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-11-22 20:02:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:32,295 INFO L93 Difference]: Finished difference Result 1000 states and 1087 transitions. [2021-11-22 20:02:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 20:02:32,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 113 [2021-11-22 20:02:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:32,298 INFO L225 Difference]: With dead ends: 1000 [2021-11-22 20:02:32,298 INFO L226 Difference]: Without dead ends: 772 [2021-11-22 20:02:32,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-11-22 20:02:32,313 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 435 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:32,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 1114 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:02:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2021-11-22 20:02:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 490. [2021-11-22 20:02:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 483 states have (on average 1.0952380952380953) internal successors, (529), 489 states have internal predecessors, (529), 0 states have call successors, (0), 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-11-22 20:02:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 529 transitions. [2021-11-22 20:02:32,360 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 529 transitions. Word has length 113 [2021-11-22 20:02:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:32,360 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 529 transitions. [2021-11-22 20:02:32,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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-11-22 20:02:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 529 transitions. [2021-11-22 20:02:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-22 20:02:32,361 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:32,368 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:32,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-22 20:02:32,369 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:32,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1825981826, now seen corresponding path program 1 times [2021-11-22 20:02:32,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:32,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65168989] [2021-11-22 20:02:32,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:32,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 20:02:32,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:32,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65168989] [2021-11-22 20:02:32,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65168989] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:32,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:32,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:02:32,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478112278] [2021-11-22 20:02:32,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:32,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:02:32,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:02:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:02:32,551 INFO L87 Difference]: Start difference. First operand 490 states and 529 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 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-11-22 20:02:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:32,793 INFO L93 Difference]: Finished difference Result 726 states and 792 transitions. [2021-11-22 20:02:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:02:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 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 115 [2021-11-22 20:02:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:32,795 INFO L225 Difference]: With dead ends: 726 [2021-11-22 20:02:32,795 INFO L226 Difference]: Without dead ends: 490 [2021-11-22 20:02:32,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:02:32,796 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 112 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:32,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 627 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:02:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-11-22 20:02:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2021-11-22 20:02:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 467 states have (on average 1.0963597430406853) internal successors, (512), 473 states have internal predecessors, (512), 0 states have call successors, (0), 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-11-22 20:02:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 512 transitions. [2021-11-22 20:02:32,819 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 512 transitions. Word has length 115 [2021-11-22 20:02:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:32,819 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 512 transitions. [2021-11-22 20:02:32,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 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-11-22 20:02:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 512 transitions. [2021-11-22 20:02:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-22 20:02:32,820 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:32,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:32,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-22 20:02:32,820 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 165132074, now seen corresponding path program 1 times [2021-11-22 20:02:32,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:32,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871083193] [2021-11-22 20:02:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:32,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:33,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871083193] [2021-11-22 20:02:33,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871083193] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:33,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:33,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:02:33,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427563620] [2021-11-22 20:02:33,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:33,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:02:33,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:33,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:02:33,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:02:33,121 INFO L87 Difference]: Start difference. First operand 474 states and 512 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-22 20:02:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:33,488 INFO L93 Difference]: Finished difference Result 504 states and 543 transitions. [2021-11-22 20:02:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:02:33,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2021-11-22 20:02:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:33,490 INFO L225 Difference]: With dead ends: 504 [2021-11-22 20:02:33,490 INFO L226 Difference]: Without dead ends: 491 [2021-11-22 20:02:33,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:02:33,491 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 118 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:33,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 861 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:02:33,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-11-22 20:02:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2021-11-22 20:02:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 482 states have (on average 1.0933609958506223) internal successors, (527), 488 states have internal predecessors, (527), 0 states have call successors, (0), 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-11-22 20:02:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 527 transitions. [2021-11-22 20:02:33,519 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 527 transitions. Word has length 116 [2021-11-22 20:02:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:33,520 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 527 transitions. [2021-11-22 20:02:33,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-22 20:02:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 527 transitions. [2021-11-22 20:02:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-22 20:02:33,521 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:33,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:33,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-22 20:02:33,521 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash 336163357, now seen corresponding path program 1 times [2021-11-22 20:02:33,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:33,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355286739] [2021-11-22 20:02:33,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:33,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:33,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355286739] [2021-11-22 20:02:33,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355286739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:33,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:33,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-22 20:02:33,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294083677] [2021-11-22 20:02:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:33,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-22 20:02:33,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-22 20:02:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-11-22 20:02:33,925 INFO L87 Difference]: Start difference. First operand 489 states and 527 transitions. Second operand has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-22 20:02:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:36,047 INFO L93 Difference]: Finished difference Result 547 states and 585 transitions. [2021-11-22 20:02:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-22 20:02:36,047 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2021-11-22 20:02:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:36,048 INFO L225 Difference]: With dead ends: 547 [2021-11-22 20:02:36,048 INFO L226 Difference]: Without dead ends: 437 [2021-11-22 20:02:36,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=459, Invalid=1797, Unknown=0, NotChecked=0, Total=2256 [2021-11-22 20:02:36,049 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 644 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:36,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [644 Valid, 2233 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 20:02:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-22 20:02:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 381. [2021-11-22 20:02:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 374 states have (on average 1.1149732620320856) internal successors, (417), 380 states have internal predecessors, (417), 0 states have call successors, (0), 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-11-22 20:02:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 417 transitions. [2021-11-22 20:02:36,079 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 417 transitions. Word has length 116 [2021-11-22 20:02:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:36,080 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 417 transitions. [2021-11-22 20:02:36,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-22 20:02:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 417 transitions. [2021-11-22 20:02:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-22 20:02:36,081 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:36,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:36,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-22 20:02:36,081 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash -936034782, now seen corresponding path program 1 times [2021-11-22 20:02:36,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:36,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232912738] [2021-11-22 20:02:36,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:36,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:36,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:36,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232912738] [2021-11-22 20:02:36,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232912738] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:36,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:36,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 20:02:36,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867193953] [2021-11-22 20:02:36,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:36,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 20:02:36,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:36,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 20:02:36,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:02:36,399 INFO L87 Difference]: Start difference. First operand 381 states and 417 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 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-11-22 20:02:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:37,411 INFO L93 Difference]: Finished difference Result 1039 states and 1123 transitions. [2021-11-22 20:02:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-22 20:02:37,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2021-11-22 20:02:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:37,414 INFO L225 Difference]: With dead ends: 1039 [2021-11-22 20:02:37,414 INFO L226 Difference]: Without dead ends: 924 [2021-11-22 20:02:37,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-11-22 20:02:37,415 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 762 mSDsluCounter, 2327 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:37,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [762 Valid, 2696 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 20:02:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2021-11-22 20:02:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 426. [2021-11-22 20:02:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 419 states have (on average 1.1050119331742243) internal successors, (463), 425 states have internal predecessors, (463), 0 states have call successors, (0), 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-11-22 20:02:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 463 transitions. [2021-11-22 20:02:37,437 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 463 transitions. Word has length 117 [2021-11-22 20:02:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:37,438 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 463 transitions. [2021-11-22 20:02:37,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 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-11-22 20:02:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 463 transitions. [2021-11-22 20:02:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-22 20:02:37,439 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:37,439 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:37,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-22 20:02:37,439 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:37,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:37,439 INFO L85 PathProgramCache]: Analyzing trace with hash -41275811, now seen corresponding path program 1 times [2021-11-22 20:02:37,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:37,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953875878] [2021-11-22 20:02:37,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:37,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-22 20:02:37,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:37,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953875878] [2021-11-22 20:02:37,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953875878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:37,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:37,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:02:37,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991731067] [2021-11-22 20:02:37,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:37,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:02:37,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:37,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:02:37,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:02:37,628 INFO L87 Difference]: Start difference. First operand 426 states and 463 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 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-11-22 20:02:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:37,926 INFO L93 Difference]: Finished difference Result 722 states and 787 transitions. [2021-11-22 20:02:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:02:37,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 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 118 [2021-11-22 20:02:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:37,931 INFO L225 Difference]: With dead ends: 722 [2021-11-22 20:02:37,931 INFO L226 Difference]: Without dead ends: 521 [2021-11-22 20:02:37,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:02:37,932 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 258 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:37,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 1164 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:02:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-11-22 20:02:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 423. [2021-11-22 20:02:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 416 states have (on average 1.1009615384615385) internal successors, (458), 422 states have internal predecessors, (458), 0 states have call successors, (0), 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-11-22 20:02:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 458 transitions. [2021-11-22 20:02:37,953 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 458 transitions. Word has length 118 [2021-11-22 20:02:37,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:37,953 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 458 transitions. [2021-11-22 20:02:37,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 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-11-22 20:02:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 458 transitions. [2021-11-22 20:02:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-22 20:02:37,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:37,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:37,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-22 20:02:37,954 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:37,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 454959078, now seen corresponding path program 1 times [2021-11-22 20:02:37,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:37,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568505640] [2021-11-22 20:02:37,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:37,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:38,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:38,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568505640] [2021-11-22 20:02:38,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568505640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:38,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:38,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 20:02:38,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752569957] [2021-11-22 20:02:38,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:38,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 20:02:38,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:38,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 20:02:38,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:02:38,226 INFO L87 Difference]: Start difference. First operand 423 states and 458 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-22 20:02:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:39,309 INFO L93 Difference]: Finished difference Result 1137 states and 1232 transitions. [2021-11-22 20:02:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 20:02:39,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2021-11-22 20:02:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:39,312 INFO L225 Difference]: With dead ends: 1137 [2021-11-22 20:02:39,312 INFO L226 Difference]: Without dead ends: 916 [2021-11-22 20:02:39,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2021-11-22 20:02:39,313 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 692 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:39,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 2095 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 20:02:39,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-11-22 20:02:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 423. [2021-11-22 20:02:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 416 states have (on average 1.0985576923076923) internal successors, (457), 422 states have internal predecessors, (457), 0 states have call successors, (0), 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-11-22 20:02:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 457 transitions. [2021-11-22 20:02:39,337 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 457 transitions. Word has length 119 [2021-11-22 20:02:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:39,338 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 457 transitions. [2021-11-22 20:02:39,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-22 20:02:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 457 transitions. [2021-11-22 20:02:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-22 20:02:39,341 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:39,342 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:39,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-22 20:02:39,342 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1400001760, now seen corresponding path program 1 times [2021-11-22 20:02:39,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:39,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857964762] [2021-11-22 20:02:39,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:39,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 20:02:39,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:39,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857964762] [2021-11-22 20:02:39,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857964762] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:39,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:39,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:02:39,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603780735] [2021-11-22 20:02:39,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:39,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:02:39,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:02:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:02:39,794 INFO L87 Difference]: Start difference. First operand 423 states and 457 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 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-11-22 20:02:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:40,296 INFO L93 Difference]: Finished difference Result 633 states and 679 transitions. [2021-11-22 20:02:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 20:02:40,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 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 120 [2021-11-22 20:02:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:40,298 INFO L225 Difference]: With dead ends: 633 [2021-11-22 20:02:40,298 INFO L226 Difference]: Without dead ends: 542 [2021-11-22 20:02:40,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-11-22 20:02:40,299 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 274 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:40,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 1344 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 20:02:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-11-22 20:02:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 430. [2021-11-22 20:02:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 423 states have (on average 1.0969267139479906) internal successors, (464), 429 states have internal predecessors, (464), 0 states have call successors, (0), 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-11-22 20:02:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 464 transitions. [2021-11-22 20:02:40,323 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 464 transitions. Word has length 120 [2021-11-22 20:02:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:40,323 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 464 transitions. [2021-11-22 20:02:40,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 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-11-22 20:02:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 464 transitions. [2021-11-22 20:02:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-22 20:02:40,324 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:40,324 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:40,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-22 20:02:40,324 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:40,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash -98883855, now seen corresponding path program 1 times [2021-11-22 20:02:40,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:40,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888948181] [2021-11-22 20:02:40,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:40,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-22 20:02:40,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:40,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888948181] [2021-11-22 20:02:40,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888948181] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:40,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:40,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:02:40,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636474431] [2021-11-22 20:02:40,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:40,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:02:40,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:40,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:02:40,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:02:40,533 INFO L87 Difference]: Start difference. First operand 430 states and 464 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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-11-22 20:02:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:40,949 INFO L93 Difference]: Finished difference Result 667 states and 714 transitions. [2021-11-22 20:02:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 20:02:40,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 121 [2021-11-22 20:02:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:40,951 INFO L225 Difference]: With dead ends: 667 [2021-11-22 20:02:40,951 INFO L226 Difference]: Without dead ends: 556 [2021-11-22 20:02:40,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:02:40,951 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 182 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:40,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 932 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:02:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-11-22 20:02:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 429. [2021-11-22 20:02:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 422 states have (on average 1.0971563981042654) internal successors, (463), 428 states have internal predecessors, (463), 0 states have call successors, (0), 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-11-22 20:02:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 463 transitions. [2021-11-22 20:02:40,976 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 463 transitions. Word has length 121 [2021-11-22 20:02:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:40,976 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 463 transitions. [2021-11-22 20:02:40,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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-11-22 20:02:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 463 transitions. [2021-11-22 20:02:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-22 20:02:40,977 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:40,977 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:40,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-22 20:02:40,978 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:40,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:40,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1798115573, now seen corresponding path program 1 times [2021-11-22 20:02:40,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:40,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925637592] [2021-11-22 20:02:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:40,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:02:41,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:41,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925637592] [2021-11-22 20:02:41,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925637592] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:02:41,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395224699] [2021-11-22 20:02:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:41,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:02:41,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:02:41,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:02:41,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 20:02:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:41,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 2997 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-22 20:02:41,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:02:41,883 INFO L388 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-11-22 20:02:41,936 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:02:41,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 20:02:42,116 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:02:42,117 INFO L388 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-11-22 20:02:42,147 INFO L388 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 17 treesize of output 19 [2021-11-22 20:02:42,166 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:02:42,167 INFO L388 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 21 treesize of output 23 [2021-11-22 20:02:42,400 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:02:42,401 INFO L388 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 17 treesize of output 23 [2021-11-22 20:02:42,484 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:02:42,484 INFO L388 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 21 treesize of output 27 [2021-11-22 20:02:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:02:42,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:02:43,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset|) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) is different from false [2021-11-22 20:02:43,151 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) is different from false [2021-11-22 20:02:43,284 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) is different from false [2021-11-22 20:02:43,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0)))) is different from false [2021-11-22 20:02:43,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_1992) |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0)))) is different from false [2021-11-22 20:02:43,934 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:43,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 161 treesize of output 160 [2021-11-22 20:02:43,947 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:02:43,947 INFO L388 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 168 treesize of output 166 [2021-11-22 20:02:43,952 INFO L388 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 174 treesize of output 170 [2021-11-22 20:02:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-11-22 20:02:44,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395224699] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:02:44,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:02:44,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 19] total 47 [2021-11-22 20:02:44,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564991636] [2021-11-22 20:02:44,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:02:44,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-22 20:02:44,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:44,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-22 20:02:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1549, Unknown=29, NotChecked=420, Total=2162 [2021-11-22 20:02:44,383 INFO L87 Difference]: Start difference. First operand 429 states and 463 transitions. Second operand has 47 states, 47 states have (on average 6.0) internal successors, (282), 47 states have internal predecessors, (282), 0 states have call successors, (0), 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-11-22 20:02:44,916 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0)))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) 0)) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)) is different from false [2021-11-22 20:02:44,919 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) 0)) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 0) 18446744073709551616) 0))) is different from false [2021-11-22 20:02:44,922 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 0)) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 0) 18446744073709551616) 0))) is different from false [2021-11-22 20:02:44,925 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 0)) (= (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) .cse0) (not (= (mod (select .cse0 0) 18446744073709551616) 0)))) is different from false [2021-11-22 20:02:44,928 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 0)) (or |c_ULTIMATE.start_aws_byte_cursor_is_valid_#t~short694#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) (= .cse1 .cse2) (not (= (mod (select .cse2 0) 18446744073709551616) 0)))) is different from false [2021-11-22 20:02:44,931 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 0)) (= .cse0 .cse1) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset|))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))) (not (= (mod (select .cse1 0) 18446744073709551616) 0)))) is different from false [2021-11-22 20:02:44,934 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|))) (and (let ((.cse0 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 0) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 0)) (not (= (mod (select .cse1 0) 18446744073709551616) 0)))) is different from false [2021-11-22 20:02:44,938 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|))) (and (let ((.cse0 (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_1994 (Array Int Int))) (or (= (mod (select v_ArrVal_1994 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset|) 18446744073709551616) 0) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| v_ArrVal_1994) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 0) (not (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) (not (= (mod (select .cse1 0) 18446744073709551616) 0)))) is different from false [2021-11-22 20:02:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:45,901 INFO L93 Difference]: Finished difference Result 734 states and 795 transitions. [2021-11-22 20:02:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-22 20:02:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 6.0) internal successors, (282), 47 states have internal predecessors, (282), 0 states have call successors, (0), 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 123 [2021-11-22 20:02:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:45,903 INFO L225 Difference]: With dead ends: 734 [2021-11-22 20:02:45,903 INFO L226 Difference]: Without dead ends: 451 [2021-11-22 20:02:45,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 221 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=429, Invalid=3124, Unknown=39, NotChecked=1664, Total=5256 [2021-11-22 20:02:45,905 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 396 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1224 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:45,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 2759 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1201 Invalid, 0 Unknown, 1224 Unchecked, 0.7s Time] [2021-11-22 20:02:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-11-22 20:02:45,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 417. [2021-11-22 20:02:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 410 states have (on average 1.0902439024390245) internal successors, (447), 416 states have internal predecessors, (447), 0 states have call successors, (0), 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-11-22 20:02:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 447 transitions. [2021-11-22 20:02:45,934 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 447 transitions. Word has length 123 [2021-11-22 20:02:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:45,935 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 447 transitions. [2021-11-22 20:02:45,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.0) internal successors, (282), 47 states have internal predecessors, (282), 0 states have call successors, (0), 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-11-22 20:02:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 447 transitions. [2021-11-22 20:02:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-22 20:02:45,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:45,936 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:45,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-22 20:02:46,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-11-22 20:02:46,157 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:46,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -735247728, now seen corresponding path program 1 times [2021-11-22 20:02:46,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:46,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747259824] [2021-11-22 20:02:46,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:46,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:02:46,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747259824] [2021-11-22 20:02:46,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747259824] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:46,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:46,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:02:46,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604454598] [2021-11-22 20:02:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:46,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:02:46,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:02:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:02:46,394 INFO L87 Difference]: Start difference. First operand 417 states and 447 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 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-11-22 20:02:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:46,833 INFO L93 Difference]: Finished difference Result 827 states and 900 transitions. [2021-11-22 20:02:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 20:02:46,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 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 124 [2021-11-22 20:02:46,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:46,835 INFO L225 Difference]: With dead ends: 827 [2021-11-22 20:02:46,835 INFO L226 Difference]: Without dead ends: 615 [2021-11-22 20:02:46,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:02:46,836 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 258 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:46,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 866 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:02:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-11-22 20:02:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 417. [2021-11-22 20:02:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 410 states have (on average 1.0902439024390245) internal successors, (447), 416 states have internal predecessors, (447), 0 states have call successors, (0), 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-11-22 20:02:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 447 transitions. [2021-11-22 20:02:46,861 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 447 transitions. Word has length 124 [2021-11-22 20:02:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:46,861 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 447 transitions. [2021-11-22 20:02:46,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 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-11-22 20:02:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 447 transitions. [2021-11-22 20:02:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-11-22 20:02:46,862 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:46,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:46,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-22 20:02:46,862 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:46,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:46,863 INFO L85 PathProgramCache]: Analyzing trace with hash -171805035, now seen corresponding path program 1 times [2021-11-22 20:02:46,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:46,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757257238] [2021-11-22 20:02:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:46,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:47,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757257238] [2021-11-22 20:02:47,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757257238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:02:47,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:02:47,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 20:02:47,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133533046] [2021-11-22 20:02:47,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:02:47,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 20:02:47,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:02:47,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 20:02:47,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:02:47,443 INFO L87 Difference]: Start difference. First operand 417 states and 447 transitions. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-22 20:02:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:02:48,199 INFO L93 Difference]: Finished difference Result 681 states and 731 transitions. [2021-11-22 20:02:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 20:02:48,200 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2021-11-22 20:02:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:02:48,201 INFO L225 Difference]: With dead ends: 681 [2021-11-22 20:02:48,201 INFO L226 Difference]: Without dead ends: 580 [2021-11-22 20:02:48,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-11-22 20:02:48,201 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 300 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:02:48,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 1819 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 20:02:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-11-22 20:02:48,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 412. [2021-11-22 20:02:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 405 states have (on average 1.0864197530864197) internal successors, (440), 411 states have internal predecessors, (440), 0 states have call successors, (0), 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-11-22 20:02:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 440 transitions. [2021-11-22 20:02:48,246 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 440 transitions. Word has length 125 [2021-11-22 20:02:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:02:48,259 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 440 transitions. [2021-11-22 20:02:48,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-22 20:02:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 440 transitions. [2021-11-22 20:02:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-22 20:02:48,275 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:02:48,275 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:02:48,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-22 20:02:48,276 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:02:48,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:02:48,276 INFO L85 PathProgramCache]: Analyzing trace with hash -733051638, now seen corresponding path program 1 times [2021-11-22 20:02:48,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:02:48,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061586629] [2021-11-22 20:02:48,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:48,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:02:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:49,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:02:49,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061586629] [2021-11-22 20:02:49,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061586629] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:02:49,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198013965] [2021-11-22 20:02:49,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:02:49,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:02:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:02:49,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:02:49,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-22 20:02:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:02:52,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 2942 conjuncts, 228 conjunts are in the unsatisfiable core [2021-11-22 20:02:52,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:02:52,497 INFO L388 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-11-22 20:02:52,651 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:02:52,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-22 20:02:52,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 20:02:52,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:02:52,738 INFO L388 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 23 treesize of output 22 [2021-11-22 20:02:53,010 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:02:53,010 INFO L388 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-11-22 20:02:53,054 INFO L388 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 16 treesize of output 18 [2021-11-22 20:02:53,057 INFO L388 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 26 treesize of output 26 [2021-11-22 20:02:53,086 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:02:53,086 INFO L388 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 45 treesize of output 45 [2021-11-22 20:02:53,096 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:02:53,096 INFO L388 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 39 treesize of output 41 [2021-11-22 20:02:56,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:56,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:56,050 INFO L354 Elim1Store]: treesize reduction 101, result has 2.9 percent of original size [2021-11-22 20:02:56,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 261 treesize of output 214 [2021-11-22 20:02:56,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:56,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:02:56,073 INFO L354 Elim1Store]: treesize reduction 101, result has 2.9 percent of original size [2021-11-22 20:02:56,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 202 treesize of output 151 [2021-11-22 20:02:56,939 INFO L354 Elim1Store]: treesize reduction 401, result has 16.3 percent of original size [2021-11-22 20:02:56,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 35 case distinctions, treesize of input 135 treesize of output 150 [2021-11-22 20:02:57,426 INFO L354 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2021-11-22 20:02:57,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 111 [2021-11-22 20:02:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:02:57,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:03:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:03,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198013965] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:03:03,761 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:03:03,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 33, 19] total 61 [2021-11-22 20:03:03,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069570212] [2021-11-22 20:03:03,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:03:03,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-11-22 20:03:03,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:03,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-11-22 20:03:03,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3470, Unknown=1, NotChecked=0, Total=3660 [2021-11-22 20:03:03,763 INFO L87 Difference]: Start difference. First operand 412 states and 440 transitions. Second operand has 61 states, 61 states have (on average 5.344262295081967) internal successors, (326), 61 states have internal predecessors, (326), 0 states have call successors, (0), 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-11-22 20:03:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:10,845 INFO L93 Difference]: Finished difference Result 776 states and 824 transitions. [2021-11-22 20:03:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-11-22 20:03:10,845 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 5.344262295081967) internal successors, (326), 61 states have internal predecessors, (326), 0 states have call successors, (0), 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 128 [2021-11-22 20:03:10,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:10,846 INFO L225 Difference]: With dead ends: 776 [2021-11-22 20:03:10,846 INFO L226 Difference]: Without dead ends: 647 [2021-11-22 20:03:10,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4383 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=944, Invalid=16611, Unknown=1, NotChecked=0, Total=17556 [2021-11-22 20:03:10,858 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 909 mSDsluCounter, 5477 mSDsCounter, 0 mSdLazyCounter, 3219 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 5677 SdHoareTripleChecker+Invalid, 5145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 3219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1715 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:10,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [909 Valid, 5677 Invalid, 5145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 3219 Invalid, 0 Unknown, 1715 Unchecked, 1.6s Time] [2021-11-22 20:03:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2021-11-22 20:03:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 414. [2021-11-22 20:03:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 407 states have (on average 1.085995085995086) internal successors, (442), 413 states have internal predecessors, (442), 0 states have call successors, (0), 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-11-22 20:03:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 442 transitions. [2021-11-22 20:03:10,887 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 442 transitions. Word has length 128 [2021-11-22 20:03:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:10,887 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 442 transitions. [2021-11-22 20:03:10,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 5.344262295081967) internal successors, (326), 61 states have internal predecessors, (326), 0 states have call successors, (0), 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-11-22 20:03:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 442 transitions. [2021-11-22 20:03:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-22 20:03:10,888 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:10,889 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:03:10,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-22 20:03:11,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-11-22 20:03:11,099 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:03:11,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2046735154, now seen corresponding path program 1 times [2021-11-22 20:03:11,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:11,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796721855] [2021-11-22 20:03:11,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:11,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:12,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:12,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796721855] [2021-11-22 20:03:12,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796721855] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:03:12,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194094597] [2021-11-22 20:03:12,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:12,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:03:12,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:03:12,186 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:03:12,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-22 20:03:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:14,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 2969 conjuncts, 102 conjunts are in the unsatisfiable core [2021-11-22 20:03:14,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:03:14,195 INFO L388 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-11-22 20:03:14,241 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:03:14,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-22 20:03:14,311 INFO L388 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 21 treesize of output 17 [2021-11-22 20:03:14,452 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-22 20:03:14,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-22 20:03:14,499 INFO L388 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 23 treesize of output 23 [2021-11-22 20:03:14,520 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:03:14,520 INFO L388 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 27 treesize of output 27 [2021-11-22 20:03:18,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:03:18,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:03:18,697 INFO L354 Elim1Store]: treesize reduction 122, result has 13.5 percent of original size [2021-11-22 20:03:18,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 59 treesize of output 70 [2021-11-22 20:03:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:18,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:03:36,260 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_22| Int) (|v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_13| Int) (v_ArrVal_2306 Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset_22| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_13|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_22|) (+ |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset_22| 8))) (.cse2 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 8))) (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)))) (not (= (select .cse1 8) .cse2)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_13| (store .cse1 0 v_ArrVal_2306)) |ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 8) 0)) (not (= .cse0 .cse2))))) is different from false [2021-11-22 20:03:39,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_22| Int) (v_ArrVal_2305 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_13| Int) (v_ArrVal_2306 Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset_22| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2305))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_13|)) (.cse2 (select (select .cse0 |ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 8)) (.cse3 (select (select .cse0 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_22|) (+ |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset_22| 8)))) (or (not (= (select (select (store .cse0 |v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_13| (store .cse1 0 v_ArrVal_2306)) |ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 8) 0)) (not (= .cse2 (select .cse1 8))) (not (= .cse2 .cse3)) (not (= .cse3 (select (select .cse0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)))))))) is different from false [2021-11-22 20:03:41,302 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:03:41,302 INFO L388 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 169 treesize of output 99 [2021-11-22 20:03:41,338 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:03:41,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 528 treesize of output 566 [2021-11-22 20:03:41,361 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:03:41,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 550 treesize of output 534 [2021-11-22 20:03:55,252 INFO L388 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 8 treesize of output 4 [2021-11-22 20:03:55,796 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:03:55,796 INFO L388 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 25 treesize of output 27 [2021-11-22 20:03:55,850 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:03:55,851 INFO L388 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 15 treesize of output 19 [2021-11-22 20:03:56,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-22 20:03:56,465 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:03:56,465 INFO L388 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 25 treesize of output 27 [2021-11-22 20:03:56,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-22 20:03:58,839 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:03:58,839 INFO L388 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 25 treesize of output 27 [2021-11-22 20:03:59,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-22 20:04:10,582 INFO L388 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 98 treesize of output 88 [2021-11-22 20:04:15,455 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:04:15,456 INFO L388 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 33 treesize of output 33 [2021-11-22 20:04:16,020 INFO L354 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-11-22 20:04:16,021 INFO L388 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 23 treesize of output 18 [2021-11-22 20:04:16,122 INFO L354 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-11-22 20:04:16,122 INFO L388 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 33 treesize of output 26 [2021-11-22 20:04:16,470 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:04:16,471 INFO L388 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 33 treesize of output 33 [2021-11-22 20:04:27,483 INFO L388 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 8 treesize of output 4 [2021-11-22 20:06:53,572 INFO L388 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 23 treesize of output 15 [2021-11-22 20:06:53,603 INFO L388 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 10 treesize of output 6 [2021-11-22 20:06:53,640 INFO L388 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 23 treesize of output 15 [2021-11-22 20:06:54,127 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:06:54,128 INFO L388 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 19 treesize of output 23 [2021-11-22 20:06:54,177 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:06:54,177 INFO L388 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 31 treesize of output 31 [2021-11-22 20:06:54,516 INFO L388 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 23 treesize of output 15 [2021-11-22 20:06:54,560 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:06:54,581 INFO L388 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 23 treesize of output 15 [2021-11-22 20:06:56,103 INFO L388 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 23 treesize of output 15 [2021-11-22 20:06:56,133 INFO L388 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 10 treesize of output 6 [2021-11-22 20:06:56,166 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:06:56,177 INFO L388 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 23 treesize of output 15 [2021-11-22 20:06:56,569 INFO L388 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 28 treesize of output 20 [2021-11-22 20:06:56,580 INFO L388 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 31 treesize of output 23 [2021-11-22 20:06:57,487 INFO L388 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 28 treesize of output 20 [2021-11-22 20:06:57,506 INFO L388 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 31 treesize of output 23 [2021-11-22 20:06:57,908 INFO L388 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 23 treesize of output 15 [2021-11-22 20:06:57,992 INFO L388 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 10 treesize of output 6 [2021-11-22 20:06:58,101 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:06:58,134 INFO L388 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 23 treesize of output 15 [2021-11-22 20:06:59,517 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:06:59,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 108 [2021-11-22 20:07:00,629 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:07:00,630 INFO L388 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 19 treesize of output 23 [2021-11-22 20:07:00,789 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:07:00,790 INFO L388 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 31 treesize of output 31 [2021-11-22 20:07:01,206 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:07:01,207 INFO L388 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 31 treesize of output 31 [2021-11-22 20:07:08,267 INFO L388 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 23 treesize of output 15 [2021-11-22 20:07:08,323 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-22 20:07:08,323 INFO L388 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 49 treesize of output 1 [2021-11-22 20:07:08,548 INFO L388 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 23 treesize of output 15 [2021-11-22 20:07:08,630 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-22 20:07:08,631 INFO L388 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 49 treesize of output 1 [2021-11-22 20:07:11,547 INFO L388 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 29 treesize of output 21 [2021-11-22 20:07:11,579 INFO L388 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 26 treesize of output 18 [2021-11-22 20:07:11,639 INFO L388 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 28 treesize of output 20 [2021-11-22 20:07:11,673 INFO L388 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 31 treesize of output 23 [2021-11-22 20:07:12,456 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:07:12,456 INFO L388 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 143 treesize of output 227 [2021-11-22 20:07:16,085 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:07:16,125 INFO L388 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 23 treesize of output 15 [2021-11-22 20:07:17,091 INFO L388 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 29 treesize of output 21 [2021-11-22 20:07:17,144 INFO L388 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 26 treesize of output 18 [2021-11-22 20:07:37,231 INFO L388 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 23 treesize of output 15 [2021-11-22 20:07:37,262 INFO L388 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 10 treesize of output 6 [2021-11-22 20:07:37,303 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:07:37,316 INFO L388 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 23 treesize of output 15 [2021-11-22 20:07:38,126 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:07:38,126 INFO L388 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 19 treesize of output 23 [2021-11-22 20:07:38,187 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:07:38,187 INFO L388 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 31 treesize of output 31 [2021-11-22 20:07:38,309 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:07:38,309 INFO L388 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 31 treesize of output 31 [2021-11-22 20:07:39,327 INFO L388 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 23 treesize of output 15 [2021-11-22 20:07:39,452 INFO L388 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 10 treesize of output 6 [2021-11-22 20:07:39,616 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:07:39,669 INFO L388 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 23 treesize of output 15 [2021-11-22 20:07:45,061 INFO L388 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 28 treesize of output 20 [2021-11-22 20:07:45,116 INFO L388 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 31 treesize of output 23 [2021-11-22 20:08:12,221 INFO L388 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 8 treesize of output 4 [2021-11-22 20:08:12,380 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:08:12,381 INFO L388 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 31 treesize of output 31 [2021-11-22 20:08:13,209 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-22 20:08:13,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 1 [2021-11-22 20:08:14,565 INFO L388 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 51 treesize of output 35 [2021-11-22 20:08:14,644 INFO L388 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 28 treesize of output 20 [2021-11-22 20:08:14,688 INFO L388 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 31 treesize of output 23 [2021-11-22 20:08:14,729 INFO L388 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 28 treesize of output 20 [2021-11-22 20:08:14,828 INFO L388 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 31 treesize of output 23 [2021-11-22 20:08:14,871 INFO L388 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 28 treesize of output 20 [2021-11-22 20:08:14,916 INFO L388 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 31 treesize of output 23 [2021-11-22 20:08:14,958 INFO L388 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 28 treesize of output 20 [2021-11-22 20:08:15,246 INFO L388 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 28 treesize of output 20 [2021-11-22 20:08:15,298 INFO L388 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 31 treesize of output 23 [2021-11-22 20:08:15,404 INFO L388 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 28 treesize of output 20 [2021-11-22 20:08:15,451 INFO L388 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 31 treesize of output 23 [2021-11-22 20:08:15,615 INFO L388 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 28 treesize of output 20 [2021-11-22 20:08:15,663 INFO L388 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 31 treesize of output 23 [2021-11-22 20:08:16,011 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-22 20:08:16,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 1 [2021-11-22 20:08:16,031 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-22 20:08:16,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 1 [2021-11-22 20:08:16,281 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:08:16,352 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:08:16,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 108 [2021-11-22 20:08:17,031 INFO L388 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 31 treesize of output 23 [2021-11-22 20:08:17,052 INFO L388 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 28 treesize of output 20 [2021-11-22 20:08:17,370 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-22 20:08:17,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 1 [2021-11-22 20:08:17,507 INFO L388 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 26 treesize of output 18 [2021-11-22 20:08:17,523 INFO L388 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 23 treesize of output 15 [2021-11-22 20:08:39,398 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:08:39,399 INFO L388 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 29 treesize of output 29 [2021-11-22 20:08:39,470 INFO L388 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 21 treesize of output 13 [2021-11-22 20:08:39,569 INFO L388 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 21 treesize of output 13 [2021-11-22 20:08:39,701 INFO L388 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 21 treesize of output 13 [2021-11-22 20:08:39,795 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-22 20:08:39,796 INFO L388 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 29 treesize of output 1 [2021-11-22 20:08:39,832 INFO L388 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 21 treesize of output 13 [2021-11-22 20:08:40,522 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-22 20:08:40,523 INFO L388 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 29 treesize of output 1 [2021-11-22 20:08:40,648 INFO L388 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 21 treesize of output 13 [2021-11-22 20:08:40,940 INFO L388 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 21 treesize of output 13 [2021-11-22 20:08:41,091 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-22 20:08:41,092 INFO L388 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 29 treesize of output 1 [2021-11-22 20:08:52,056 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:08:52,057 INFO L388 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 137 treesize of output 125 [2021-11-22 20:08:52,079 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:08:52,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 160 [2021-11-22 20:08:52,513 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:08:52,514 INFO L388 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 94 treesize of output 166 [2021-11-22 20:08:52,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:52,843 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-22 20:08:52,843 INFO L388 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 1 [2021-11-22 20:08:52,854 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-11-22 20:08:52,854 INFO L388 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 92 treesize of output 1 [2021-11-22 20:08:52,867 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-11-22 20:08:52,867 INFO L388 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 92 treesize of output 1 [2021-11-22 20:08:52,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:52,881 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-22 20:08:52,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 1 [2021-11-22 20:08:52,893 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:08:52,905 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:08:52,905 INFO L388 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 17 treesize of output 9 [2021-11-22 20:08:52,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:52,916 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 141 [2021-11-22 20:08:52,925 INFO L354 Elim1Store]: treesize reduction 170, result has 0.6 percent of original size [2021-11-22 20:08:52,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 138 treesize of output 1 [2021-11-22 20:08:52,943 INFO L388 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 95 treesize of output 83 [2021-11-22 20:08:52,983 INFO L354 Elim1Store]: treesize reduction 23, result has 65.7 percent of original size [2021-11-22 20:08:52,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 95 [2021-11-22 20:08:53,047 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:08:53,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:53,065 INFO L354 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2021-11-22 20:08:53,066 INFO L388 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 1 [2021-11-22 20:08:53,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:53,086 INFO L354 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2021-11-22 20:08:53,086 INFO L388 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 84 treesize of output 1 [2021-11-22 20:08:53,098 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-11-22 20:08:53,098 INFO L388 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 94 treesize of output 1 [2021-11-22 20:08:53,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:53,109 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-22 20:08:53,109 INFO L388 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 1 [2021-11-22 20:08:53,124 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:08:53,135 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-22 20:08:53,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 1 [2021-11-22 20:08:53,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:53,191 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:08:53,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2021-11-22 20:08:53,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:53,201 INFO L354 Elim1Store]: treesize reduction 170, result has 0.6 percent of original size [2021-11-22 20:08:53,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 200 treesize of output 1 [2021-11-22 20:08:53,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:53,212 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-22 20:08:53,212 INFO L388 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 1 [2021-11-22 20:08:53,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:53,223 INFO L354 Elim1Store]: treesize reduction 170, result has 0.6 percent of original size [2021-11-22 20:08:53,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 196 treesize of output 1 [2021-11-22 20:08:53,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:53,231 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-22 20:08:53,232 INFO L388 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 121 treesize of output 1 [2021-11-22 20:08:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:08:53,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194094597] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:08:53,772 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:08:53,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 19] total 53 [2021-11-22 20:08:53,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515881158] [2021-11-22 20:08:53,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:08:53,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-11-22 20:08:53,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:08:53,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-22 20:08:53,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2358, Unknown=19, NotChecked=198, Total=2756 [2021-11-22 20:08:53,773 INFO L87 Difference]: Start difference. First operand 414 states and 442 transitions. Second operand has 53 states, 53 states have (on average 6.716981132075472) internal successors, (356), 53 states have internal predecessors, (356), 0 states have call successors, (0), 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-11-22 20:08:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:08:59,161 INFO L93 Difference]: Finished difference Result 567 states and 609 transitions. [2021-11-22 20:08:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-22 20:08:59,161 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 6.716981132075472) internal successors, (356), 53 states have internal predecessors, (356), 0 states have call successors, (0), 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 130 [2021-11-22 20:08:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:08:59,162 INFO L225 Difference]: With dead ends: 567 [2021-11-22 20:08:59,162 INFO L226 Difference]: Without dead ends: 408 [2021-11-22 20:08:59,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 243 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1506 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=1121, Invalid=6523, Unknown=20, NotChecked=346, Total=8010 [2021-11-22 20:08:59,164 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 1363 mSDsluCounter, 4361 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 4522 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1193 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:08:59,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1363 Valid, 4522 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1640 Invalid, 0 Unknown, 1193 Unchecked, 0.8s Time] [2021-11-22 20:08:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-11-22 20:08:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 402. [2021-11-22 20:08:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 396 states have (on average 1.0782828282828283) internal successors, (427), 401 states have internal predecessors, (427), 0 states have call successors, (0), 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-11-22 20:08:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 427 transitions. [2021-11-22 20:08:59,189 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 427 transitions. Word has length 130 [2021-11-22 20:08:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:08:59,189 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 427 transitions. [2021-11-22 20:08:59,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 6.716981132075472) internal successors, (356), 53 states have internal predecessors, (356), 0 states have call successors, (0), 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-11-22 20:08:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 427 transitions. [2021-11-22 20:08:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-22 20:08:59,190 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:08:59,190 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:08:59,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-22 20:08:59,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:08:59,411 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:08:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:08:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1033042839, now seen corresponding path program 1 times [2021-11-22 20:08:59,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:08:59,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28217690] [2021-11-22 20:08:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:08:59,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:08:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:08:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:08:59,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:08:59,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28217690] [2021-11-22 20:08:59,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28217690] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:08:59,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:08:59,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 20:08:59,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865589491] [2021-11-22 20:08:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:08:59,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 20:08:59,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:08:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 20:08:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:08:59,629 INFO L87 Difference]: Start difference. First operand 402 states and 427 transitions. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 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-11-22 20:09:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:09:00,124 INFO L93 Difference]: Finished difference Result 544 states and 576 transitions. [2021-11-22 20:09:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 20:09:00,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2021-11-22 20:09:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:09:00,126 INFO L225 Difference]: With dead ends: 544 [2021-11-22 20:09:00,126 INFO L226 Difference]: Without dead ends: 487 [2021-11-22 20:09:00,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-11-22 20:09:00,126 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 283 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:09:00,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 1631 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 20:09:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-11-22 20:09:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 443. [2021-11-22 20:09:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 437 states have (on average 1.0732265446224256) internal successors, (469), 442 states have internal predecessors, (469), 0 states have call successors, (0), 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-11-22 20:09:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 469 transitions. [2021-11-22 20:09:00,152 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 469 transitions. Word has length 136 [2021-11-22 20:09:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:09:00,153 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 469 transitions. [2021-11-22 20:09:00,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 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-11-22 20:09:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 469 transitions. [2021-11-22 20:09:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-22 20:09:00,153 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:09:00,154 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:09:00,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-22 20:09:00,154 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:09:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:09:00,154 INFO L85 PathProgramCache]: Analyzing trace with hash -206795408, now seen corresponding path program 1 times [2021-11-22 20:09:00,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:09:00,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872649761] [2021-11-22 20:09:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:09:00,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:09:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:09:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:09:00,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:09:00,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872649761] [2021-11-22 20:09:00,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872649761] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:09:00,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092374520] [2021-11-22 20:09:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:09:00,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:09:00,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:09:00,724 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:09:00,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-22 20:09:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:09:02,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 2993 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-22 20:09:02,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:09:02,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:09:02,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:09:02,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:09:02,666 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 20:09:02,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 74 treesize of output 70 [2021-11-22 20:09:02,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:09:02,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:09:02,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:09:02,674 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 20:09:02,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 63 treesize of output 59 [2021-11-22 20:09:03,099 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 20:09:03,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 77 treesize of output 57 [2021-11-22 20:09:03,102 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 20:09:03,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 34 [2021-11-22 20:09:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:09:03,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:09:03,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092374520] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:09:03,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 20:09:03,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18] total 28 [2021-11-22 20:09:03,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711187214] [2021-11-22 20:09:03,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:09:03,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 20:09:03,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:09:03,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 20:09:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2021-11-22 20:09:03,167 INFO L87 Difference]: Start difference. First operand 443 states and 469 transitions. Second operand has 12 states, 12 states have (on average 11.083333333333334) internal successors, (133), 12 states have internal predecessors, (133), 0 states have call successors, (0), 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-11-22 20:09:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:09:03,652 INFO L93 Difference]: Finished difference Result 633 states and 672 transitions. [2021-11-22 20:09:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 20:09:03,653 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.083333333333334) internal successors, (133), 12 states have internal predecessors, (133), 0 states have call successors, (0), 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 137 [2021-11-22 20:09:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:09:03,653 INFO L225 Difference]: With dead ends: 633 [2021-11-22 20:09:03,653 INFO L226 Difference]: Without dead ends: 538 [2021-11-22 20:09:03,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2021-11-22 20:09:03,656 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 151 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:09:03,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 1891 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 445 Invalid, 0 Unknown, 282 Unchecked, 0.2s Time] [2021-11-22 20:09:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-11-22 20:09:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 453. [2021-11-22 20:09:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 447 states have (on average 1.0738255033557047) internal successors, (480), 452 states have internal predecessors, (480), 0 states have call successors, (0), 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-11-22 20:09:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 480 transitions. [2021-11-22 20:09:03,689 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 480 transitions. Word has length 137 [2021-11-22 20:09:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:09:03,690 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 480 transitions. [2021-11-22 20:09:03,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.083333333333334) internal successors, (133), 12 states have internal predecessors, (133), 0 states have call successors, (0), 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-11-22 20:09:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 480 transitions. [2021-11-22 20:09:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-22 20:09:03,691 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:09:03,691 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:09:03,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-22 20:09:03,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2021-11-22 20:09:03,916 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:09:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:09:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash 147555263, now seen corresponding path program 1 times [2021-11-22 20:09:03,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:09:03,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828583586] [2021-11-22 20:09:03,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:09:03,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:09:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:09:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:09:04,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:09:04,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828583586] [2021-11-22 20:09:04,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828583586] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:09:04,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215874278] [2021-11-22 20:09:04,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:09:04,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:09:04,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:09:04,592 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:09:04,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-22 20:09:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:09:07,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 3015 conjuncts, 106 conjunts are in the unsatisfiable core [2021-11-22 20:09:07,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:09:07,051 INFO L388 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-11-22 20:09:07,132 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:09:07,132 INFO L388 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 21 [2021-11-22 20:09:07,202 INFO L388 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 22 treesize of output 18 [2021-11-22 20:09:07,328 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:09:07,328 INFO L388 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-11-22 20:09:07,366 INFO L388 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 27 treesize of output 27 [2021-11-22 20:09:07,386 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:09:07,387 INFO L388 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 31 treesize of output 31 [2021-11-22 20:09:15,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:09:15,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:09:15,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:09:15,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:09:15,839 INFO L354 Elim1Store]: treesize reduction 124, result has 13.3 percent of original size [2021-11-22 20:09:15,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 69 treesize of output 76 [2021-11-22 20:09:26,634 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-22 20:09:26,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2021-11-22 20:09:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:09:26,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:09:26,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215874278] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:09:26,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 20:09:26,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [19] total 35 [2021-11-22 20:09:26,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129544834] [2021-11-22 20:09:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:09:26,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-22 20:09:26,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:09:26,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-22 20:09:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1083, Unknown=9, NotChecked=0, Total=1190 [2021-11-22 20:09:26,649 INFO L87 Difference]: Start difference. First operand 453 states and 480 transitions. Second operand has 20 states, 20 states have (on average 6.95) internal successors, (139), 20 states have internal predecessors, (139), 0 states have call successors, (0), 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-11-22 20:09:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:09:27,243 INFO L93 Difference]: Finished difference Result 646 states and 690 transitions. [2021-11-22 20:09:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-22 20:09:27,243 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.95) internal successors, (139), 20 states have internal predecessors, (139), 0 states have call successors, (0), 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 143 [2021-11-22 20:09:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:09:27,244 INFO L225 Difference]: With dead ends: 646 [2021-11-22 20:09:27,244 INFO L226 Difference]: Without dead ends: 551 [2021-11-22 20:09:27,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=222, Invalid=1931, Unknown=9, NotChecked=0, Total=2162 [2021-11-22 20:09:27,245 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 276 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:09:27,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 2569 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 332 Invalid, 0 Unknown, 487 Unchecked, 0.2s Time] [2021-11-22 20:09:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-11-22 20:09:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 473. [2021-11-22 20:09:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 467 states have (on average 1.0792291220556745) internal successors, (504), 472 states have internal predecessors, (504), 0 states have call successors, (0), 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-11-22 20:09:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 504 transitions. [2021-11-22 20:09:27,275 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 504 transitions. Word has length 143 [2021-11-22 20:09:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:09:27,275 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 504 transitions. [2021-11-22 20:09:27,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.95) internal successors, (139), 20 states have internal predecessors, (139), 0 states have call successors, (0), 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-11-22 20:09:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 504 transitions. [2021-11-22 20:09:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-22 20:09:27,276 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:09:27,276 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:09:27,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-11-22 20:09:27,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:09:27,488 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:09:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:09:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash 224121130, now seen corresponding path program 1 times [2021-11-22 20:09:27,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:09:27,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719875602] [2021-11-22 20:09:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:09:27,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:09:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:09:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:09:27,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:09:27,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719875602] [2021-11-22 20:09:27,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719875602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:09:27,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:09:27,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:09:27,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085384382] [2021-11-22 20:09:27,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:09:27,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:09:27,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:09:27,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:09:27,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:09:27,717 INFO L87 Difference]: Start difference. First operand 473 states and 504 transitions. Second operand has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 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-11-22 20:09:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:09:28,152 INFO L93 Difference]: Finished difference Result 630 states and 668 transitions. [2021-11-22 20:09:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:09:28,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2021-11-22 20:09:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:09:28,154 INFO L225 Difference]: With dead ends: 630 [2021-11-22 20:09:28,154 INFO L226 Difference]: Without dead ends: 532 [2021-11-22 20:09:28,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:09:28,154 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 407 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:09:28,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 1588 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:09:28,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-11-22 20:09:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 453. [2021-11-22 20:09:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 447 states have (on average 1.0782997762863535) internal successors, (482), 452 states have internal predecessors, (482), 0 states have call successors, (0), 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-11-22 20:09:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 482 transitions. [2021-11-22 20:09:28,208 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 482 transitions. Word has length 144 [2021-11-22 20:09:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:09:28,208 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 482 transitions. [2021-11-22 20:09:28,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 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-11-22 20:09:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 482 transitions. [2021-11-22 20:09:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-22 20:09:28,209 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:09:28,210 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:09:28,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-22 20:09:28,210 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:09:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:09:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1904863248, now seen corresponding path program 1 times [2021-11-22 20:09:28,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:09:28,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573091195] [2021-11-22 20:09:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:09:28,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:09:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:09:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:09:28,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:09:28,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573091195] [2021-11-22 20:09:28,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573091195] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:09:28,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:09:28,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:09:28,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171757178] [2021-11-22 20:09:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:09:28,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:09:28,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:09:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:09:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:09:28,522 INFO L87 Difference]: Start difference. First operand 453 states and 482 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-11-22 20:09:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:09:28,816 INFO L93 Difference]: Finished difference Result 641 states and 687 transitions. [2021-11-22 20:09:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:09:28,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2021-11-22 20:09:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:09:28,817 INFO L225 Difference]: With dead ends: 641 [2021-11-22 20:09:28,817 INFO L226 Difference]: Without dead ends: 506 [2021-11-22 20:09:28,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:09:28,818 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 112 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:09:28,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 766 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:09:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-11-22 20:09:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 485. [2021-11-22 20:09:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 479 states have (on average 1.0751565762004176) internal successors, (515), 484 states have internal predecessors, (515), 0 states have call successors, (0), 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-11-22 20:09:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 515 transitions. [2021-11-22 20:09:28,850 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 515 transitions. Word has length 145 [2021-11-22 20:09:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:09:28,850 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 515 transitions. [2021-11-22 20:09:28,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-11-22 20:09:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 515 transitions. [2021-11-22 20:09:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-22 20:09:28,851 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:09:28,852 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:09:28,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-22 20:09:28,852 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:09:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:09:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2024208941, now seen corresponding path program 1 times [2021-11-22 20:09:28,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:09:28,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115078726] [2021-11-22 20:09:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:09:28,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:09:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:09:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:09:29,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:09:29,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115078726] [2021-11-22 20:09:29,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115078726] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:09:29,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057412688] [2021-11-22 20:09:29,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:09:29,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:09:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:09:29,262 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:09:29,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-22 20:09:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:09:29,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-22 20:09:29,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:09:29,806 INFO L388 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-11-22 20:09:29,890 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:09:29,890 INFO L388 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 21 [2021-11-22 20:09:29,953 INFO L388 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 22 treesize of output 18 [2021-11-22 20:09:30,101 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:09:30,101 INFO L388 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-11-22 20:09:30,134 INFO L388 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 27 treesize of output 27 [2021-11-22 20:09:30,154 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:09:30,154 INFO L388 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 31 treesize of output 31 [2021-11-22 20:09:30,742 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:09:30,742 INFO L388 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 23 treesize of output 27 [2021-11-22 20:09:30,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 20:09:30,821 INFO L388 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 11 treesize of output 7 [2021-11-22 20:09:30,831 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:09:30,831 INFO L388 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 28 treesize of output 32 [2021-11-22 20:09:31,255 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:09:31,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 56 treesize of output 52 [2021-11-22 20:09:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:09:31,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:09:31,686 INFO L388 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 38 treesize of output 34 [2021-11-22 20:09:31,781 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (forall ((v_ArrVal_2805 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0))))) is different from false [2021-11-22 20:09:31,852 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) is different from false [2021-11-22 20:09:33,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)))) is different from false [2021-11-22 20:09:33,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2801 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2801) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0)))) is different from false [2021-11-22 20:09:33,825 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:09:33,826 INFO L388 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 40 treesize of output 40 [2021-11-22 20:09:33,830 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:09:33,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 162 treesize of output 159 [2021-11-22 20:09:33,833 INFO L388 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 155 treesize of output 147 [2021-11-22 20:09:33,834 INFO L388 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 147 treesize of output 131 [2021-11-22 20:09:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-11-22 20:09:34,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057412688] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:09:34,403 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:09:34,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 20] total 48 [2021-11-22 20:09:34,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809338747] [2021-11-22 20:09:34,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:09:34,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-22 20:09:34,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:09:34,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-22 20:09:34,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1737, Unknown=13, NotChecked=348, Total=2256 [2021-11-22 20:09:34,405 INFO L87 Difference]: Start difference. First operand 485 states and 515 transitions. Second operand has 48 states, 48 states have (on average 8.833333333333334) internal successors, (424), 48 states have internal predecessors, (424), 0 states have call successors, (0), 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-11-22 20:09:34,810 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)))) (and (not (= .cse0 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)))) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0))) is different from false [2021-11-22 20:09:34,812 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|))) is different from false [2021-11-22 20:09:34,815 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0)))) is different from false [2021-11-22 20:09:34,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (or |c_ULTIMATE.start_aws_byte_cursor_is_valid_#t~short694#1| (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset|))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0)))) is different from false [2021-11-22 20:09:34,820 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset|))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0)))) is different from false [2021-11-22 20:09:34,822 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0)))) is different from false [2021-11-22 20:09:34,825 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset|))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0)))) is different from false [2021-11-22 20:09:34,829 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset|))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0)))) is different from false [2021-11-22 20:09:34,867 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (<= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#res#1.len| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#res#1.len|) 18446744073709551616)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0)))) is different from false [2021-11-22 20:09:34,870 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_2805 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse1)) (not (= .cse1 0)) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|) 0)))) is different from false [2021-11-22 20:09:34,915 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.offset| 0) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse1)) (not (= .cse1 0)) (not (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (forall ((v_ArrVal_2805 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_2805) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0))))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|))) is different from false [2021-11-22 20:09:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:09:36,426 INFO L93 Difference]: Finished difference Result 670 states and 711 transitions. [2021-11-22 20:09:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-22 20:09:36,427 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 8.833333333333334) internal successors, (424), 48 states have internal predecessors, (424), 0 states have call successors, (0), 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 148 [2021-11-22 20:09:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:09:36,428 INFO L225 Difference]: With dead ends: 670 [2021-11-22 20:09:36,428 INFO L226 Difference]: Without dead ends: 558 [2021-11-22 20:09:36,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=722, Invalid=5794, Unknown=24, NotChecked=2580, Total=9120 [2021-11-22 20:09:36,429 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 356 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 3264 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1010 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 20:09:36,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 3264 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2077 Invalid, 0 Unknown, 1010 Unchecked, 0.9s Time] [2021-11-22 20:09:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-11-22 20:09:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 509. [2021-11-22 20:09:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 503 states have (on average 1.0715705765407555) internal successors, (539), 508 states have internal predecessors, (539), 0 states have call successors, (0), 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-11-22 20:09:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 539 transitions. [2021-11-22 20:09:36,461 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 539 transitions. Word has length 148 [2021-11-22 20:09:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:09:36,461 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 539 transitions. [2021-11-22 20:09:36,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 8.833333333333334) internal successors, (424), 48 states have internal predecessors, (424), 0 states have call successors, (0), 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-11-22 20:09:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 539 transitions. [2021-11-22 20:09:36,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-22 20:09:36,462 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:09:36,463 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:09:36,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-11-22 20:09:36,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-11-22 20:09:36,683 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:09:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:09:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1676118121, now seen corresponding path program 1 times [2021-11-22 20:09:36,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:09:36,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497091864] [2021-11-22 20:09:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:09:36,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:09:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:09:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:09:38,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:09:38,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497091864] [2021-11-22 20:09:38,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497091864] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:09:38,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043170863] [2021-11-22 20:09:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:09:38,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:09:38,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:09:38,141 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:09:38,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-22 20:09:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:09:41,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 3075 conjuncts, 127 conjunts are in the unsatisfiable core [2021-11-22 20:09:41,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:09:41,548 INFO L388 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-11-22 20:09:41,607 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:09:41,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-22 20:09:41,668 INFO L388 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 11 treesize of output 7 [2021-11-22 20:09:41,745 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:09:41,745 INFO L388 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-11-22 20:09:41,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-22 20:09:41,775 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:09:41,775 INFO L388 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 18 treesize of output 20 [2021-11-22 20:09:42,016 INFO L354 Elim1Store]: treesize reduction 27, result has 40.0 percent of original size [2021-11-22 20:09:42,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 52 treesize of output 58 [2021-11-22 20:09:42,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:09:42,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:09:42,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:09:42,078 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-22 20:09:42,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:09:42,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:09:42,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:09:42,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:09:42,623 INFO L354 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2021-11-22 20:09:42,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 49 [2021-11-22 20:09:43,035 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-22 20:09:43,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 31 [2021-11-22 20:09:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:09:43,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:09:45,157 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| Int) (|v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_18| Int) (v_ArrVal_2941 Int) (v_ArrVal_2939 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_30| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_2939))) (let ((.cse3 (select .cse4 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_30|))) (let ((.cse6 (store .cse3 0 v_ArrVal_2941))) (let ((.cse2 (+ (select .cse6 8) 1))) (let ((.cse5 (store .cse4 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_30| (store .cse6 8 .cse2)))) (let ((.cse0 (select (select .cse5 |v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_18|) 8)) (.cse1 (select (select .cse5 |ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 8))) (or (not (= .cse0 0)) (not (= .cse0 .cse1)) (not (= .cse1 .cse2)) (not (= (select .cse3 8) (select (select .cse4 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)))))))))))) is different from false [2021-11-22 20:09:46,486 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:09:46,486 INFO L388 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 333 treesize of output 193 [2021-11-22 20:09:46,527 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:09:46,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1366 treesize of output 1334 [2021-11-22 20:09:46,565 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:09:46,566 INFO L388 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 1219 treesize of output 1147 [2021-11-22 20:09:46,723 INFO L388 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 8 treesize of output 4 [2021-11-22 20:10:16,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-11-22 20:10:17,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-11-22 20:10:17,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-11-22 20:10:17,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-11-22 20:10:21,651 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:21,827 INFO L388 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 8 treesize of output 4 [2021-11-22 20:10:21,903 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:21,915 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:22,197 INFO L388 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 8 treesize of output 4 [2021-11-22 20:10:22,339 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:22,356 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:23,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-11-22 20:10:23,104 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:10:23,105 INFO L388 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 22 treesize of output 26 [2021-11-22 20:10:23,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-11-22 20:10:28,414 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:28,439 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:28,448 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:28,484 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:28,494 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:28,539 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:28,550 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:30,156 INFO L388 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 159 treesize of output 149 [2021-11-22 20:10:30,218 INFO L388 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 28 treesize of output 24 [2021-11-22 20:10:30,253 INFO L388 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 136 treesize of output 126 [2021-11-22 20:10:30,601 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:10:30,601 INFO L388 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 27 treesize of output 29 [2021-11-22 20:10:30,784 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:10:30,784 INFO L388 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 54 treesize of output 52 [2021-11-22 20:10:30,910 INFO L388 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 8 treesize of output 4 [2021-11-22 20:10:31,138 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:10:31,139 INFO L388 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 17 treesize of output 21 [2021-11-22 20:10:36,134 INFO L354 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2021-11-22 20:10:36,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 34 [2021-11-22 20:10:36,148 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:10:36,148 INFO L388 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 21 treesize of output 25 [2021-11-22 20:10:36,180 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-11-22 20:10:36,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2021-11-22 20:10:36,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,203 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2021-11-22 20:10:36,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:10:36,217 INFO L354 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2021-11-22 20:10:36,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 1 [2021-11-22 20:10:36,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:10:36,227 INFO L354 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2021-11-22 20:10:36,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 1 [2021-11-22 20:10:36,238 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-11-22 20:10:36,238 INFO L388 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 38 treesize of output 29 [2021-11-22 20:10:36,262 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-22 20:10:36,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 69 [2021-11-22 20:10:36,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,282 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:10:36,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 1 [2021-11-22 20:10:36,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,291 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:10:36,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 1 [2021-11-22 20:10:36,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,301 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:10:36,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 1 [2021-11-22 20:10:36,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,317 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:10:36,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2021-11-22 20:10:36,323 INFO L388 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 38 treesize of output 34 [2021-11-22 20:10:36,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,327 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-11-22 20:10:36,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,338 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-11-22 20:10:36,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-22 20:10:36,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,350 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:10:36,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 1 [2021-11-22 20:10:36,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,358 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:10:36,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 1 [2021-11-22 20:10:36,368 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:10:36,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-11-22 20:10:36,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:36,397 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-11-22 20:10:36,403 INFO L388 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 28 treesize of output 24 [2021-11-22 20:10:36,416 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:10:36,416 INFO L388 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 44 treesize of output 1 [2021-11-22 20:10:36,446 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:10:36,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043170863] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:10:36,813 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:10:36,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 19] total 53 [2021-11-22 20:10:36,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010908054] [2021-11-22 20:10:36,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:10:36,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-11-22 20:10:36,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:10:36,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-22 20:10:36,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2454, Unknown=9, NotChecked=100, Total=2756 [2021-11-22 20:10:36,815 INFO L87 Difference]: Start difference. First operand 509 states and 539 transitions. Second operand has 53 states, 53 states have (on average 6.962264150943396) internal successors, (369), 53 states have internal predecessors, (369), 0 states have call successors, (0), 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-11-22 20:10:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:10:38,675 INFO L93 Difference]: Finished difference Result 975 states and 1033 transitions. [2021-11-22 20:10:38,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-22 20:10:38,676 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 6.962264150943396) internal successors, (369), 53 states have internal predecessors, (369), 0 states have call successors, (0), 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 148 [2021-11-22 20:10:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:10:38,677 INFO L225 Difference]: With dead ends: 975 [2021-11-22 20:10:38,677 INFO L226 Difference]: Without dead ends: 880 [2021-11-22 20:10:38,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 280 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=853, Invalid=6974, Unknown=9, NotChecked=174, Total=8010 [2021-11-22 20:10:38,678 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 391 mSDsluCounter, 3865 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 4072 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1100 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 20:10:38,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 4072 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1035 Invalid, 0 Unknown, 1100 Unchecked, 0.5s Time] [2021-11-22 20:10:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2021-11-22 20:10:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 587. [2021-11-22 20:10:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 581 states have (on average 1.0774526678141136) internal successors, (626), 586 states have internal predecessors, (626), 0 states have call successors, (0), 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-11-22 20:10:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 626 transitions. [2021-11-22 20:10:38,747 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 626 transitions. Word has length 148 [2021-11-22 20:10:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:10:38,747 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 626 transitions. [2021-11-22 20:10:38,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 6.962264150943396) internal successors, (369), 53 states have internal predecessors, (369), 0 states have call successors, (0), 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-11-22 20:10:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 626 transitions. [2021-11-22 20:10:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-22 20:10:38,748 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:10:38,749 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:10:38,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-22 20:10:38,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-11-22 20:10:38,961 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:10:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:10:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash -140970160, now seen corresponding path program 1 times [2021-11-22 20:10:38,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:10:38,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704794580] [2021-11-22 20:10:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:10:38,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:10:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:10:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 20:10:39,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:10:39,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704794580] [2021-11-22 20:10:39,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704794580] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:10:39,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:10:39,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:10:39,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640747514] [2021-11-22 20:10:39,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:10:39,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:10:39,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:10:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:10:39,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:10:39,230 INFO L87 Difference]: Start difference. First operand 587 states and 626 transitions. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:10:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:10:39,763 INFO L93 Difference]: Finished difference Result 753 states and 801 transitions. [2021-11-22 20:10:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 20:10:39,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2021-11-22 20:10:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:10:39,765 INFO L225 Difference]: With dead ends: 753 [2021-11-22 20:10:39,765 INFO L226 Difference]: Without dead ends: 682 [2021-11-22 20:10:39,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-11-22 20:10:39,765 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 627 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:10:39,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 632 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:10:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-11-22 20:10:39,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 587. [2021-11-22 20:10:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 581 states have (on average 1.0740103270223753) internal successors, (624), 586 states have internal predecessors, (624), 0 states have call successors, (0), 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-11-22 20:10:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 624 transitions. [2021-11-22 20:10:39,808 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 624 transitions. Word has length 151 [2021-11-22 20:10:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:10:39,808 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 624 transitions. [2021-11-22 20:10:39,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:10:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 624 transitions. [2021-11-22 20:10:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-22 20:10:39,809 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:10:39,810 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:10:39,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-22 20:10:39,810 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:10:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:10:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1534767165, now seen corresponding path program 1 times [2021-11-22 20:10:39,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:10:39,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045482445] [2021-11-22 20:10:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:10:39,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:10:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:10:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:10:40,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:10:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045482445] [2021-11-22 20:10:40,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045482445] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:10:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037119977] [2021-11-22 20:10:40,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:10:40,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:10:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:10:40,233 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:10:40,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-22 20:10:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:10:40,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 3113 conjuncts, 122 conjunts are in the unsatisfiable core [2021-11-22 20:10:40,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:10:40,783 INFO L388 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-11-22 20:10:40,853 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:10:40,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-22 20:10:40,903 INFO L388 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 23 treesize of output 19 [2021-11-22 20:10:41,013 INFO L354 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2021-11-22 20:10:41,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2021-11-22 20:10:41,041 INFO L388 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 27 treesize of output 27 [2021-11-22 20:10:41,061 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:10:41,061 INFO L388 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 31 treesize of output 31 [2021-11-22 20:10:41,350 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-11-22 20:10:41,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 40 [2021-11-22 20:10:41,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2021-11-22 20:10:41,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-11-22 20:10:41,629 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:10:41,629 INFO L388 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 15 treesize of output 21 [2021-11-22 20:10:41,700 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:10:41,700 INFO L388 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 19 treesize of output 25 [2021-11-22 20:10:41,712 INFO L388 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 11 treesize of output 7 [2021-11-22 20:10:42,056 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:10:42,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 47 treesize of output 43 [2021-11-22 20:10:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:10:42,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:10:42,471 INFO L388 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 38 treesize of output 34 [2021-11-22 20:10:42,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (forall ((v_ArrVal_3162 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0))))) is different from false [2021-11-22 20:10:42,635 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)))) is different from false [2021-11-22 20:10:43,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3157 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| v_ArrVal_3157)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8))) (store .cse0 .cse1 (select .cse0 .cse1)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) is different from false [2021-11-22 20:10:43,443 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3157 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_3157))) (store .cse0 8 (select .cse0 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) is different from false [2021-11-22 20:10:43,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_3157 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_3157))) (store .cse0 8 (select .cse0 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) is different from false [2021-11-22 20:10:44,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3157 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_3157))) (store .cse0 8 (select .cse0 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)))) is different from false [2021-11-22 20:10:44,025 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3156 (Array Int Int)) (v_ArrVal_3157 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)) (not (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3156))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_3157))) (store .cse1 8 (select .cse1 8))))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0)))) is different from false [2021-11-22 20:10:45,034 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:10:45,035 INFO L388 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 84 treesize of output 64 [2021-11-22 20:10:45,047 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:10:45,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 886 treesize of output 866 [2021-11-22 20:10:45,059 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:10:45,059 INFO L388 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 960 treesize of output 934 [2021-11-22 20:10:45,065 INFO L388 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 934 treesize of output 854 [2021-11-22 20:10:45,230 INFO L388 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 8 treesize of output 4 [2021-11-22 20:10:45,271 INFO L388 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 8 treesize of output 4 [2021-11-22 20:10:45,297 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:10:45,297 INFO L388 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 30 treesize of output 34 [2021-11-22 20:10:45,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:10:45,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:45,327 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-11-22 20:10:45,346 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:10:45,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:10:45,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:10:45,357 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-22 20:10:45,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 1 [2021-11-22 20:10:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2021-11-22 20:10:45,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037119977] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:10:45,931 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:10:45,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 23] total 51 [2021-11-22 20:10:45,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180630101] [2021-11-22 20:10:45,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:10:45,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-22 20:10:45,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:10:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-22 20:10:45,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1744, Unknown=12, NotChecked=630, Total=2550 [2021-11-22 20:10:45,933 INFO L87 Difference]: Start difference. First operand 587 states and 624 transitions. Second operand has 51 states, 51 states have (on average 8.607843137254902) internal successors, (439), 51 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:10:46,288 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) 8) 0)) (= (select |c_#valid| |c_ULTIMATE.start_bounded_malloc_#res#1.base|) 1) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|)) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3156 (Array Int Int)) (v_ArrVal_3157 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)) (not (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3156))) (store .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse2 (store (select .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_3157))) (store .cse2 8 (select .cse2 8))))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse0)))) is different from false [2021-11-22 20:10:46,290 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)))) (and (not (= .cse0 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|)) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3156 (Array Int Int)) (v_ArrVal_3157 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)) (not (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3156))) (store .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse2 (store (select .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_3157))) (store .cse2 8 (select .cse2 8))))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse0)))) is different from false [2021-11-22 20:10:48,295 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0)) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3157 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_3157))) (store .cse0 8 (select .cse0 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)) is different from false [2021-11-22 20:10:50,299 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8) 0)) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_ArrVal_3157 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_3157))) (store .cse0 8 (select .cse0 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) is different from false [2021-11-22 20:10:52,304 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8) 0)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3157 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_ArrVal_3157))) (store .cse0 8 (select .cse0 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) is different from false [2021-11-22 20:10:54,314 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8) 0)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3157 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| v_ArrVal_3157)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8))) (store .cse0 .cse1 (select .cse0 .cse1)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) is different from false [2021-11-22 20:10:54,320 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8) 0)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) is different from false [2021-11-22 20:10:54,390 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8) 0)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 1) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) is different from false [2021-11-22 20:10:54,419 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not |c_ULTIMATE.start_aws_byte_cursor_is_valid_#t~short694#1|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8) 0)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 1) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) is different from false [2021-11-22 20:10:54,672 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8) 0)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 1) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) is different from false [2021-11-22 20:10:54,721 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8) 0)) (forall ((v_ArrVal_3162 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) is different from false [2021-11-22 20:10:55,000 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.offset|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.offset|))) (and (<= .cse0 .cse1) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8) 0)) (not (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|)) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (forall ((v_ArrVal_3162 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3162) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0))))) (<= .cse1 .cse0))) is different from false [2021-11-22 20:10:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:10:59,225 INFO L93 Difference]: Finished difference Result 1470 states and 1569 transitions. [2021-11-22 20:10:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2021-11-22 20:10:59,226 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 8.607843137254902) internal successors, (439), 51 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2021-11-22 20:10:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:10:59,228 INFO L225 Difference]: With dead ends: 1470 [2021-11-22 20:10:59,228 INFO L226 Difference]: Without dead ends: 1358 [2021-11-22 20:10:59,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 5789 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1430, Invalid=18362, Unknown=24, NotChecked=5624, Total=25440 [2021-11-22 20:10:59,231 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 1584 mSDsluCounter, 8284 mSDsCounter, 0 mSdLazyCounter, 5191 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 8664 SdHoareTripleChecker+Invalid, 10579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 5191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5258 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:10:59,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1584 Valid, 8664 Invalid, 10579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 5191 Invalid, 0 Unknown, 5258 Unchecked, 2.3s Time] [2021-11-22 20:10:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2021-11-22 20:10:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 665. [2021-11-22 20:10:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 659 states have (on average 1.0804248861911987) internal successors, (712), 664 states have internal predecessors, (712), 0 states have call successors, (0), 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-11-22 20:10:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 712 transitions. [2021-11-22 20:10:59,284 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 712 transitions. Word has length 153 [2021-11-22 20:10:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:10:59,284 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 712 transitions. [2021-11-22 20:10:59,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 8.607843137254902) internal successors, (439), 51 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:10:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 712 transitions. [2021-11-22 20:10:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-22 20:10:59,285 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:10:59,286 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:10:59,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-22 20:10:59,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-11-22 20:10:59,507 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:10:59,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:10:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash 495068651, now seen corresponding path program 1 times [2021-11-22 20:10:59,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:10:59,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279129911] [2021-11-22 20:10:59,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:10:59,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:10:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:10:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:10:59,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:10:59,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279129911] [2021-11-22 20:10:59,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279129911] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:10:59,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251816965] [2021-11-22 20:10:59,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:10:59,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:10:59,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:10:59,986 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:10:59,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-22 20:11:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:11:00,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 3114 conjuncts, 121 conjunts are in the unsatisfiable core [2021-11-22 20:11:00,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:11:00,591 INFO L388 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-11-22 20:11:00,669 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:11:00,669 INFO L388 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 21 [2021-11-22 20:11:00,726 INFO L388 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 22 treesize of output 18 [2021-11-22 20:11:00,850 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:11:00,850 INFO L388 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-11-22 20:11:00,881 INFO L388 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 27 treesize of output 27 [2021-11-22 20:11:00,903 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:11:00,903 INFO L388 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 31 treesize of output 31 [2021-11-22 20:11:01,272 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-22 20:11:01,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 57 treesize of output 61 [2021-11-22 20:11:01,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:11:01,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:11:01,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-11-22 20:11:01,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:11:01,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:11:01,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:11:01,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:11:01,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2021-11-22 20:11:01,764 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:11:01,765 INFO L388 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 23 treesize of output 27 [2021-11-22 20:11:01,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 20:11:01,780 INFO L388 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 6 treesize of output 5 [2021-11-22 20:11:02,968 INFO L388 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 35 treesize of output 27 [2021-11-22 20:11:02,969 INFO L388 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 19 [2021-11-22 20:11:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 20:11:03,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:11:03,268 INFO L388 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 57 treesize of output 51 [2021-11-22 20:11:03,272 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:11:03,272 INFO L388 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 51 treesize of output 55 [2021-11-22 20:11:03,304 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) is different from false [2021-11-22 20:11:03,358 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) is different from false [2021-11-22 20:11:03,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3303 Int) (v_ArrVal_3305 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| v_ArrVal_3303)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8))) (store .cse0 .cse1 (select .cse0 .cse1)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)))) is different from false [2021-11-22 20:11:04,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| Int) (v_ArrVal_3303 Int) (v_ArrVal_3305 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36|))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select .cse0 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| (let ((.cse1 (store .cse0 0 v_ArrVal_3303))) (store .cse1 8 (select .cse1 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0))))) is different from false [2021-11-22 20:11:04,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| Int) (v_ArrVal_3303 Int) (v_ArrVal_3305 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|))) (or (not (= (select .cse0 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) .cse1))) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| (let ((.cse2 (store .cse0 0 v_ArrVal_3303))) (store .cse2 8 (select .cse2 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) .cse1) 0))))) is different from false [2021-11-22 20:11:05,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| Int) (v_ArrVal_3303 Int) (v_ArrVal_3305 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)) (not (= (select .cse0 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse1))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| (let ((.cse2 (store .cse0 0 v_ArrVal_3303))) (store .cse2 8 (select .cse2 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse1) 0))))) is different from false [2021-11-22 20:11:05,482 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3300 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| Int) (v_ArrVal_3303 Int) (v_ArrVal_3305 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3300))) (let ((.cse2 (select .cse0 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse1) (select .cse2 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)) (not (= (select (select (store (store .cse0 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| (let ((.cse3 (store .cse2 0 v_ArrVal_3303))) (store .cse3 8 (select .cse3 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse1) 0)))))) is different from false [2021-11-22 20:11:07,363 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:11:07,363 INFO L388 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 124 treesize of output 84 [2021-11-22 20:11:07,379 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:11:07,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 964 treesize of output 936 [2021-11-22 20:11:07,387 INFO L388 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 936 treesize of output 856 [2021-11-22 20:11:07,400 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:11:07,400 INFO L388 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 1110 treesize of output 1056 [2021-11-22 20:11:07,852 INFO L388 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 8 treesize of output 4 [2021-11-22 20:11:07,878 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:11:07,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 164 [2021-11-22 20:11:07,978 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-11-22 20:11:07,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:11:07,983 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 90 [2021-11-22 20:11:07,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:11:07,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:11:07,986 INFO L388 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 77 treesize of output 69 [2021-11-22 20:11:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-11-22 20:11:08,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251816965] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:11:08,504 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:11:08,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23, 22] total 51 [2021-11-22 20:11:08,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828944387] [2021-11-22 20:11:08,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:11:08,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-22 20:11:08,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:11:08,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-22 20:11:08,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1713, Unknown=15, NotChecked=630, Total=2550 [2021-11-22 20:11:08,513 INFO L87 Difference]: Start difference. First operand 665 states and 712 transitions. Second operand has 51 states, 51 states have (on average 8.784313725490197) internal successors, (448), 51 states have internal predecessors, (448), 0 states have call successors, (0), 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-11-22 20:11:08,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) 8) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) 8) 0))) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) 1) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3300 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| Int) (v_ArrVal_3303 Int) (v_ArrVal_3305 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3300))) (let ((.cse3 (select .cse1 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36|)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (or (not (= (select (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse2) (select .cse3 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)) (not (= (select (select (store (store .cse1 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| (let ((.cse4 (store .cse3 0 v_ArrVal_3303))) (store .cse4 8 (select .cse4 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse2) 0)))))))) is different from false [2021-11-22 20:11:08,899 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)))) (and (not (= .cse0 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3300 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| Int) (v_ArrVal_3303 Int) (v_ArrVal_3305 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3300))) (let ((.cse3 (select .cse1 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36|)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (or (not (= (select (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse2) (select .cse3 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset| 0)) (not (= (select (select (store (store .cse1 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_36| (let ((.cse4 (store .cse3 0 v_ArrVal_3303))) (store .cse4 8 (select .cse4 8)))) |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse2) 0)))))))) is different from false [2021-11-22 20:11:19,606 WARN L227 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 55 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 20:11:21,546 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|))) (let ((.cse0 (select .cse1 8))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8)) (select .cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0))))) is different from false [2021-11-22 20:11:21,612 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|))) (let ((.cse0 (select .cse2 8))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 0) (or (not |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#t~short991#1|) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset|))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8)) (select .cse2 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0))))) is different from false [2021-11-22 20:11:21,623 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|))) (let ((.cse0 (select .cse1 8))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8)) (select .cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|))) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset|))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0))))) is different from false [2021-11-22 20:11:21,807 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|))) (let ((.cse0 (select .cse1 8))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8)) (select .cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|))) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 0) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset|))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0))))) is different from false [2021-11-22 20:11:21,903 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|))) (let ((.cse0 (select .cse1 8))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not |c_ULTIMATE.start_aws_byte_cursor_is_valid_#t~short694#1|) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8)) (select .cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|))) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 0) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset|))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0))))) is different from false [2021-11-22 20:11:22,430 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|))) (let ((.cse0 (select .cse1 8))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 8)) (select .cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset|))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0))))) is different from false [2021-11-22 20:11:22,548 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|)) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset|))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0)))) is different from false [2021-11-22 20:11:22,893 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse0)) (not (= .cse0 0)) (<= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#res#1.len| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#res#1.len|) 18446744073709551616)))) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base|) 0)))) is different from false [2021-11-22 20:11:22,965 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse1)) (not (= .cse1 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|) 0)))) is different from false [2021-11-22 20:11:23,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) 8))) (and (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.offset| 0) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| Int) (v_ArrVal_3305 (Array Int Int))) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.offset| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| v_ArrVal_3305) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base| .cse1)) (not (= .cse1 0)) (not (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source#1.base|)) (= 0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|))) is different from false [2021-11-22 20:11:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:11:27,500 INFO L93 Difference]: Finished difference Result 1339 states and 1429 transitions. [2021-11-22 20:11:27,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2021-11-22 20:11:27,501 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 8.784313725490197) internal successors, (448), 51 states have internal predecessors, (448), 0 states have call successors, (0), 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 156 [2021-11-22 20:11:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:11:27,502 INFO L225 Difference]: With dead ends: 1339 [2021-11-22 20:11:27,502 INFO L226 Difference]: Without dead ends: 1171 [2021-11-22 20:11:27,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 281 SyntacticMatches, 19 SemanticMatches, 162 ConstructedPredicates, 19 IntricatePredicates, 2 DeprecatedPredicates, 7642 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=2546, Invalid=18377, Unknown=33, NotChecked=5776, Total=26732 [2021-11-22 20:11:27,505 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 1319 mSDsluCounter, 6751 mSDsCounter, 0 mSdLazyCounter, 3051 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 7028 SdHoareTripleChecker+Invalid, 7711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 3051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4494 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:11:27,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1319 Valid, 7028 Invalid, 7711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 3051 Invalid, 0 Unknown, 4494 Unchecked, 1.4s Time] [2021-11-22 20:11:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2021-11-22 20:11:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 577. [2021-11-22 20:11:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 571 states have (on average 1.0770577933450087) internal successors, (615), 576 states have internal predecessors, (615), 0 states have call successors, (0), 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-11-22 20:11:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 615 transitions. [2021-11-22 20:11:27,557 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 615 transitions. Word has length 156 [2021-11-22 20:11:27,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:11:27,557 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 615 transitions. [2021-11-22 20:11:27,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 8.784313725490197) internal successors, (448), 51 states have internal predecessors, (448), 0 states have call successors, (0), 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-11-22 20:11:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 615 transitions. [2021-11-22 20:11:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-22 20:11:27,558 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:11:27,559 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:11:27,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-11-22 20:11:27,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-11-22 20:11:27,776 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:11:27,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:11:27,777 INFO L85 PathProgramCache]: Analyzing trace with hash -635789535, now seen corresponding path program 1 times [2021-11-22 20:11:27,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:11:27,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261208225] [2021-11-22 20:11:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:11:27,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:11:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:11:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 20:11:28,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:11:28,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261208225] [2021-11-22 20:11:28,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261208225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:11:28,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:11:28,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:11:28,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112524590] [2021-11-22 20:11:28,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:11:28,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:11:28,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:11:28,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:11:28,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:11:28,118 INFO L87 Difference]: Start difference. First operand 577 states and 615 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 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-11-22 20:11:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:11:28,713 INFO L93 Difference]: Finished difference Result 761 states and 805 transitions. [2021-11-22 20:11:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 20:11:28,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 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 157 [2021-11-22 20:11:28,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:11:28,715 INFO L225 Difference]: With dead ends: 761 [2021-11-22 20:11:28,715 INFO L226 Difference]: Without dead ends: 731 [2021-11-22 20:11:28,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-11-22 20:11:28,716 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 775 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:11:28,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [775 Valid, 696 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 20:11:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2021-11-22 20:11:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 603. [2021-11-22 20:11:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 597 states have (on average 1.0770519262981575) internal successors, (643), 602 states have internal predecessors, (643), 0 states have call successors, (0), 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-11-22 20:11:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 643 transitions. [2021-11-22 20:11:28,764 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 643 transitions. Word has length 157 [2021-11-22 20:11:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:11:28,764 INFO L470 AbstractCegarLoop]: Abstraction has 603 states and 643 transitions. [2021-11-22 20:11:28,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 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-11-22 20:11:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 643 transitions. [2021-11-22 20:11:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-22 20:11:28,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:11:28,765 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:11:28,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-22 20:11:28,765 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:11:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:11:28,766 INFO L85 PathProgramCache]: Analyzing trace with hash 713791017, now seen corresponding path program 2 times [2021-11-22 20:11:28,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:11:28,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430270160] [2021-11-22 20:11:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:11:28,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:11:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:11:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-22 20:11:29,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:11:29,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430270160] [2021-11-22 20:11:29,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430270160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:11:29,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:11:29,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 20:11:29,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596696081] [2021-11-22 20:11:29,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:11:29,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 20:11:29,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:11:29,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 20:11:29,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:11:29,659 INFO L87 Difference]: Start difference. First operand 603 states and 643 transitions. Second operand has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 13 states have internal predecessors, (140), 0 states have call successors, (0), 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-11-22 20:11:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:11:30,296 INFO L93 Difference]: Finished difference Result 755 states and 804 transitions. [2021-11-22 20:11:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-22 20:11:30,297 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 13 states have internal predecessors, (140), 0 states have call successors, (0), 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 158 [2021-11-22 20:11:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:11:30,298 INFO L225 Difference]: With dead ends: 755 [2021-11-22 20:11:30,298 INFO L226 Difference]: Without dead ends: 634 [2021-11-22 20:11:30,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2021-11-22 20:11:30,298 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 308 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:11:30,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 1792 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 20:11:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2021-11-22 20:11:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 481. [2021-11-22 20:11:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 477 states have (on average 1.069182389937107) internal successors, (510), 480 states have internal predecessors, (510), 0 states have call successors, (0), 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-11-22 20:11:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 510 transitions. [2021-11-22 20:11:30,337 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 510 transitions. Word has length 158 [2021-11-22 20:11:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:11:30,337 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 510 transitions. [2021-11-22 20:11:30,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 13 states have internal predecessors, (140), 0 states have call successors, (0), 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-11-22 20:11:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 510 transitions. [2021-11-22 20:11:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-22 20:11:30,338 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:11:30,338 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:11:30,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-22 20:11:30,338 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:11:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:11:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2122278944, now seen corresponding path program 1 times [2021-11-22 20:11:30,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:11:30,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448112438] [2021-11-22 20:11:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:11:30,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:11:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:11:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:11:30,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:11:30,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448112438] [2021-11-22 20:11:30,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448112438] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:11:30,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198700377] [2021-11-22 20:11:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:11:30,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:11:30,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:11:30,681 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:11:30,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-22 20:11:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:11:31,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 3099 conjuncts, 137 conjunts are in the unsatisfiable core [2021-11-22 20:11:31,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:11:31,283 INFO L388 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-11-22 20:11:31,346 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:11:31,346 INFO L388 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 15 treesize of output 17 [2021-11-22 20:11:31,724 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-22 20:11:31,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 36 [2021-11-22 20:11:31,815 INFO L388 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 17 treesize of output 19 [2021-11-22 20:11:31,852 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:11:31,852 INFO L388 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 33 treesize of output 35 [2021-11-22 20:11:31,898 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-22 20:11:31,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 36 [2021-11-22 20:11:32,155 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-11-22 20:11:32,156 INFO L388 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 3 case distinctions, treesize of input 20 treesize of output 33 [2021-11-22 20:11:32,549 INFO L354 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2021-11-22 20:11:32,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 60 [2021-11-22 20:11:34,180 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-11-22 20:11:34,181 INFO L388 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 3 case distinctions, treesize of input 38 treesize of output 51 [2021-11-22 20:11:34,388 INFO L354 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2021-11-22 20:11:34,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 65 [2021-11-22 20:11:35,051 INFO L354 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2021-11-22 20:11:35,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 41 [2021-11-22 20:11:35,138 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:11:35,139 INFO L388 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 17 treesize of output 23 [2021-11-22 20:11:35,234 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-11-22 20:11:35,234 INFO L388 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 26 treesize of output 29 [2021-11-22 20:11:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 20:11:36,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:11:36,624 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:11:36,625 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2021-11-22 20:11:42,075 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base_24| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~#dest~0#1.base_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_27| Int) (v_ArrVal_3584 Int) (aux_div_v_ArrVal_3588_40 Int) (v_ArrVal_3585 Int) (v_ArrVal_3582 Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_40| Int)) (let ((.cse4 (store |c_#valid| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base_24| v_ArrVal_3582))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_40| v_ArrVal_3584)) (.cse3 (select v_arrayElimArr_10 0)) (.cse2 (* 18446744073709551616 aux_div_v_ArrVal_3588_40)) (.cse0 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_27| v_arrayElimArr_10))) (or (<= |v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_27| |c_#StackHeapBarrier|) (= (mod (select (select .cse0 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~#left_trimmed~0#1.base_24|) 0) 18446744073709551616) 0) (not (= (select .cse1 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~#dest~0#1.base_23|) 0)) (not (= (select (store .cse1 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~#dest~0#1.base_23| v_ArrVal_3585) |v_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0#1.base_27|) 0)) (< .cse2 .cse3) (not (= (select .cse4 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_40|) 0)) (< .cse3 .cse2) (not (= (mod (select (select .cse0 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) 18446744073709551616) 0)))))) is different from false [2021-11-22 20:11:53,904 INFO L354 Elim1Store]: treesize reduction 4, result has 88.2 percent of original size [2021-11-22 20:11:53,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 289 treesize of output 302 [2021-11-22 20:11:53,922 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:11:53,922 INFO L388 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 314 treesize of output 306 [2021-11-22 20:11:53,936 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:11:53,937 INFO L388 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 306 treesize of output 308 [2021-11-22 20:12:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:12:41,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198700377] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:12:41,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:12:41,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 30, 32] total 68 [2021-11-22 20:12:41,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905776773] [2021-11-22 20:12:41,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:12:41,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2021-11-22 20:12:41,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:12:41,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-11-22 20:12:41,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3841, Unknown=164, NotChecked=130, Total=4556 [2021-11-22 20:12:41,347 INFO L87 Difference]: Start difference. First operand 481 states and 510 transitions. Second operand has 68 states, 68 states have (on average 6.6911764705882355) internal successors, (455), 68 states have internal predecessors, (455), 0 states have call successors, (0), 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-11-22 20:12:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:12:47,888 INFO L93 Difference]: Finished difference Result 975 states and 1026 transitions. [2021-11-22 20:12:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2021-11-22 20:12:47,889 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 6.6911764705882355) internal successors, (455), 68 states have internal predecessors, (455), 0 states have call successors, (0), 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 161 [2021-11-22 20:12:47,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:12:47,890 INFO L225 Difference]: With dead ends: 975 [2021-11-22 20:12:47,890 INFO L226 Difference]: Without dead ends: 885 [2021-11-22 20:12:47,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 281 SyntacticMatches, 4 SemanticMatches, 143 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5314 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1745, Invalid=18682, Unknown=169, NotChecked=284, Total=20880 [2021-11-22 20:12:47,892 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 1144 mSDsluCounter, 8128 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 8361 SdHoareTripleChecker+Invalid, 4842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2549 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:12:47,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1144 Valid, 8361 Invalid, 4842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2187 Invalid, 0 Unknown, 2549 Unchecked, 1.3s Time] [2021-11-22 20:12:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2021-11-22 20:12:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 625. [2021-11-22 20:12:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 621 states have (on average 1.0611916264090178) internal successors, (659), 624 states have internal predecessors, (659), 0 states have call successors, (0), 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-11-22 20:12:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 659 transitions. [2021-11-22 20:12:47,945 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 659 transitions. Word has length 161 [2021-11-22 20:12:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:12:47,946 INFO L470 AbstractCegarLoop]: Abstraction has 625 states and 659 transitions. [2021-11-22 20:12:47,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 6.6911764705882355) internal successors, (455), 68 states have internal predecessors, (455), 0 states have call successors, (0), 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-11-22 20:12:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 659 transitions. [2021-11-22 20:12:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-22 20:12:47,947 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:12:47,947 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:12:47,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-22 20:12:48,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:12:48,162 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2021-11-22 20:12:48,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:12:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1647259888, now seen corresponding path program 1 times [2021-11-22 20:12:48,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:12:48,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926385758] [2021-11-22 20:12:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:12:48,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:12:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:12:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:12:56,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:12:56,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926385758] [2021-11-22 20:12:56,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926385758] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:12:56,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370300159] [2021-11-22 20:12:56,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:12:56,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:12:56,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:12:56,069 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:12:56,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-22 20:12:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:12:56,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 3105 conjuncts, 207 conjunts are in the unsatisfiable core [2021-11-22 20:12:56,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:12:56,878 INFO L388 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-11-22 20:12:57,083 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:12:57,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-22 20:12:57,258 INFO L388 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 11 treesize of output 7 [2021-11-22 20:12:57,262 INFO L388 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 23 treesize of output 19 [2021-11-22 20:12:57,269 INFO L388 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 20 [2021-11-22 20:12:57,703 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-22 20:12:57,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 24 [2021-11-22 20:12:57,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2021-11-22 20:12:57,863 INFO L388 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 23 treesize of output 23 [2021-11-22 20:12:57,878 INFO L388 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 23 treesize of output 23 [2021-11-22 20:12:58,171 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:12:58,172 INFO L388 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 140 treesize of output 138 [2021-11-22 20:12:58,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:12:58,198 INFO L354 Elim1Store]: treesize reduction 180, result has 13.0 percent of original size [2021-11-22 20:12:58,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 134 treesize of output 128 [2021-11-22 20:12:58,208 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:12:58,208 INFO L388 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 133 treesize of output 131 [2021-11-22 20:12:59,924 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:12:59,924 INFO L388 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 127 treesize of output 131 [2021-11-22 20:12:59,967 INFO L354 Elim1Store]: treesize reduction 110, result has 25.7 percent of original size [2021-11-22 20:12:59,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 126 treesize of output 140 [2021-11-22 20:12:59,990 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-11-22 20:12:59,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 139 [2021-11-22 20:13:00,016 INFO L388 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 21 treesize of output 17 [2021-11-22 20:13:00,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:13:00,066 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-11-22 20:13:00,092 INFO L388 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 7 [2021-11-22 20:13:00,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:13:00,107 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2021-11-22 20:13:06,006 INFO L388 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 104 treesize of output 92 [2021-11-22 20:13:06,009 INFO L388 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 87 treesize of output 71 [2021-11-22 20:13:06,289 INFO L354 Elim1Store]: treesize reduction 108, result has 16.3 percent of original size [2021-11-22 20:13:06,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 146 treesize of output 110 [2021-11-22 20:13:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:13:06,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:13:13,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| Int) (v_ArrVal_3727 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (or (let ((.cse0 (mod (select (select .cse17 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (and (or (<= .cse0 9223372036854775807) (and (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse1 (* (let ((.cse4 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse4)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse4) (- 18446744073709551616) (mod (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse1) (- 256)) (div (+ (mod (select .cse2 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (- 1) .cse1) (- 256))))))) (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse6 (let ((.cse8 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse8)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse8) (- 18446744073709551616) (mod (select .cse5 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))))) (<= (div (+ (mod (select .cse5 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (* .cse6 (- 1))) (- 256)) (+ (div (+ (- 256) .cse6) 256) 1)))))))) (or (and (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse10 (let ((.cse12 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse12)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse12) (mod (select .cse9 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))))) (<= (div (+ (mod (select .cse9 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (* .cse10 (- 1))) (- 256)) (+ (div (+ (- 256) .cse10) 256) 1)))))) (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse13 (* (let ((.cse16 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse15 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse16)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse16) (mod (select .cse14 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse13) (- 256)) (div (+ (mod (select .cse14 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (- 1) .cse13) (- 256)))))))) (< 9223372036854775807 .cse0)))) (not (= (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 0))) (<= |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| |c_#StackHeapBarrier|) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)))) (< 0 (mod (select v_ArrVal_3727 0) 18446744073709551616)) (= (mod (select (select .cse17 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) is different from false [2021-11-22 20:13:32,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| Int) (v_ArrVal_3727 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (or (let ((.cse0 (mod (select (select .cse17 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (and (or (<= .cse0 9223372036854775807) (and (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse1 (* (let ((.cse4 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse4)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse4) (- 18446744073709551616) (mod (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse1) (- 256)) (div (+ (mod (select .cse2 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (- 1) .cse1) (- 256))))))) (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse6 (let ((.cse8 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse8)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse8) (- 18446744073709551616) (mod (select .cse5 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))))) (<= (div (+ (mod (select .cse5 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (* .cse6 (- 1))) (- 256)) (+ (div (+ (- 256) .cse6) 256) 1)))))))) (or (and (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse10 (let ((.cse12 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse12)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse12) (mod (select .cse9 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))))) (<= (div (+ (mod (select .cse9 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (* .cse10 (- 1))) (- 256)) (+ (div (+ (- 256) .cse10) 256) 1)))))) (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse13 (* (let ((.cse16 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse15 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse16)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse16) (mod (select .cse14 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse13) (- 256)) (div (+ (mod (select .cse14 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (- 1) .cse13) (- 256)))))))) (< 9223372036854775807 .cse0)))) (<= |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| |c_#StackHeapBarrier|) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|)))) (< 0 (mod (select v_ArrVal_3727 0) 18446744073709551616)) (not (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 0) (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|))) (= (mod (select (select .cse17 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset|) 18446744073709551616) 0)))) is different from false [2021-11-22 20:13:49,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| Int) (v_ArrVal_3727 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (or (let ((.cse0 (mod (select (select .cse17 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (and (or (<= .cse0 9223372036854775807) (and (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse1 (* (let ((.cse4 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse4)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse4) (- 18446744073709551616) (mod (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse1) (- 256)) (div (+ (mod (select .cse2 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (- 1) .cse1) (- 256))))))) (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse6 (let ((.cse8 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse8)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse8) (- 18446744073709551616) (mod (select .cse5 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))))) (<= (div (+ (mod (select .cse5 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (* .cse6 (- 1))) (- 256)) (+ (div (+ (- 256) .cse6) 256) 1)))))))) (or (and (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse10 (let ((.cse12 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse12)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse12) (mod (select .cse9 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))))) (<= (div (+ (mod (select .cse9 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (* .cse10 (- 1))) (- 256)) (+ (div (+ (- 256) .cse10) 256) 1)))))) (forall ((v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse13 (* (let ((.cse16 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse15 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse16)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse16) (mod (select .cse14 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse13) (- 256)) (div (+ (mod (select .cse14 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (- 1) .cse13) (- 256)))))))) (< 9223372036854775807 .cse0)))) (not (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 0) (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (<= |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| |c_#StackHeapBarrier|) (< 0 (mod (select v_ArrVal_3727 0) 18446744073709551616)) (= (mod (select (select .cse17 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|)) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 8)))))) is different from false [2021-11-22 20:13:58,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| Int) (v_ArrVal_3719 (Array Int Int)) (v_ArrVal_3727 (Array Int Int))) (or (<= |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| |c_#StackHeapBarrier|) (< 0 (mod (select v_ArrVal_3727 0) 18446744073709551616)) (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (let ((.cse25 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8)) (.cse26 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|)) (.cse23 (mod (select .cse24 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616))) (and (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store .cse24 .cse25 (select .cse26 (+ (- 18446744073709551616) .cse23 |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|)))))) (let ((.cse21 (store .cse22 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (or (let ((.cse0 (mod (select (select .cse21 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (and (or (< 9223372036854775807 .cse0) (and (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse5 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse1 (* (let ((.cse4 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse4)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse4) (mod (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse1) (- 256)) (div (+ (- 1) (mod (select .cse2 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) .cse1) (- 256))))))) (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse10 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse10 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse7 (let ((.cse9 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse8 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse9)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse9) (mod (select .cse6 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))))) (<= (div (+ (mod (select .cse6 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (* .cse7 (- 1))) (- 256)) (+ 1 (div (+ (- 256) .cse7) 256))))))))) (or (and (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse15 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse15 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse11 (* (let ((.cse14 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse14)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse14) (mod (select .cse12 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616) (- 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse11) (- 256)) (div (+ (- 1) (mod (select .cse12 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) .cse11) (- 256))))))) (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse20 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse20 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse17 (let ((.cse19 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse19)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse19) (mod (select .cse16 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616) (- 18446744073709551616)))))) (<= (div (+ (mod (select .cse16 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (* .cse17 (- 1))) (- 256)) (+ (div (+ (- 256) .cse17) 256) 1))))))) (<= .cse0 9223372036854775807)))) (not (= (select (select .cse22 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 0) (select (select .cse22 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (<= .cse23 9223372036854775807) (= (mod (select (select .cse21 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0)))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store .cse24 .cse25 (select .cse26 (+ .cse23 |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|)))))) (let ((.cse48 (store .cse49 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (or (< 9223372036854775807 .cse23) (let ((.cse27 (mod (select (select .cse48 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (and (or (<= .cse27 9223372036854775807) (and (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse32 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse32 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse32 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse29 (select .cse30 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse28 (* (let ((.cse31 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse31)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse31) (mod (select .cse29 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616) (- 18446744073709551616)))) (- 1)))) (<= (div (+ .cse28 (- 1)) (- 256)) (div (+ .cse28 (- 1) (mod (select .cse29 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256)) (- 256))))))) (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse37 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse37 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse37 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse33 (let ((.cse36 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse36)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse36) (mod (select .cse34 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616) (- 18446744073709551616)))))) (<= (div (+ (* .cse33 (- 1)) (mod (select .cse34 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256)) (- 256)) (+ (div (+ .cse33 (- 256)) 256) 1)))))))) (or (and (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse42 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse42 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse42 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse38 (let ((.cse41 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse41)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse41) (mod (select .cse39 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))))) (<= (div (+ (* .cse38 (- 1)) (mod (select .cse39 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256)) (- 256)) (+ (div (+ (- 256) .cse38) 256) 1)))))) (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse47 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse47 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse47 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse43 (* (let ((.cse46 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse46)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse46) (mod (select .cse44 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse43) (- 256)) (div (+ (- 1) .cse43 (mod (select .cse44 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256)) (- 256)))))))) (< 9223372036854775807 .cse27)))) (not (= (select (select .cse49 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 0) (select (select .cse49 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (= (mod (select (select .cse48 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0))))))) (not (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719))) (= (select (select .cse50 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 8) (select (select .cse50 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))))))) is different from false [2021-11-22 20:14:06,278 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| Int) (v_ArrVal_3719 (Array Int Int)) (v_ArrVal_3727 (Array Int Int))) (or (<= |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| |c_#StackHeapBarrier|) (< 0 (mod (select v_ArrVal_3727 0) 18446744073709551616)) (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (let ((.cse25 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8)) (.cse26 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|)) (.cse23 (mod (select .cse24 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616))) (and (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store .cse24 .cse25 (select .cse26 (+ (- 18446744073709551616) .cse23 |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|)))))) (let ((.cse21 (store .cse22 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (or (let ((.cse0 (mod (select (select .cse21 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (and (or (< 9223372036854775807 .cse0) (and (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse5 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse1 (* (let ((.cse4 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse4)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse4) (mod (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse1) (- 256)) (div (+ (- 1) (mod (select .cse2 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) .cse1) (- 256))))))) (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse10 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse10 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse7 (let ((.cse9 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse8 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse9)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse9) (mod (select .cse6 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))))) (<= (div (+ (mod (select .cse6 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (* .cse7 (- 1))) (- 256)) (+ 1 (div (+ (- 256) .cse7) 256))))))))) (or (and (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse15 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse15 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse11 (* (let ((.cse14 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse13 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse14)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse14) (mod (select .cse12 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616) (- 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse11) (- 256)) (div (+ (- 1) (mod (select .cse12 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) .cse11) (- 256))))))) (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse20 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse20 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse17 (let ((.cse19 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse19)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse19) (mod (select .cse16 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616) (- 18446744073709551616)))))) (<= (div (+ (mod (select .cse16 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256) (* .cse17 (- 1))) (- 256)) (+ (div (+ (- 256) .cse17) 256) 1))))))) (<= .cse0 9223372036854775807)))) (not (= (select (select .cse22 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 0) (select (select .cse22 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (<= .cse23 9223372036854775807) (= (mod (select (select .cse21 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0)))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store .cse24 .cse25 (select .cse26 (+ .cse23 |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|)))))) (let ((.cse48 (store .cse49 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (or (< 9223372036854775807 .cse23) (let ((.cse27 (mod (select (select .cse48 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (and (or (<= .cse27 9223372036854775807) (and (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse32 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse32 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse32 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse29 (select .cse30 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse28 (* (let ((.cse31 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse31)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse31) (mod (select .cse29 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616) (- 18446744073709551616)))) (- 1)))) (<= (div (+ .cse28 (- 1)) (- 256)) (div (+ .cse28 (- 1) (mod (select .cse29 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256)) (- 256))))))) (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse37 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse37 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse37 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse33 (let ((.cse36 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse36)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse36) (mod (select .cse34 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616) (- 18446744073709551616)))))) (<= (div (+ (* .cse33 (- 1)) (mod (select .cse34 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256)) (- 256)) (+ (div (+ .cse33 (- 256)) 256) 1)))))))) (or (and (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse42 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse42 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse42 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse38 (let ((.cse41 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse41)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse41) (mod (select .cse39 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))))) (<= (div (+ (* .cse38 (- 1)) (mod (select .cse39 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256)) (- 256)) (+ (div (+ (- 256) .cse38) 256) 1)))))) (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3723 (Array Int Int)) (v_ArrVal_3724 (Array Int Int))) (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse47 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse47 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse47 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3727))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse43 (* (let ((.cse46 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3723) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse46)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3722) |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43| v_ArrVal_3724) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) .cse46) (mod (select .cse44 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616)))) (- 1)))) (<= (div (+ (- 1) .cse43) (- 256)) (div (+ (- 1) .cse43 (mod (select .cse44 (+ |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#old_byte_from_cur~0#1.offset| 8)) 256)) (- 256)))))))) (< 9223372036854775807 .cse27)))) (not (= (select (select .cse49 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 0) (select (select .cse49 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))) (= (mod (select (select .cse48 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0))))))) (not (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3719))) (= (select (select .cse50 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_43|) 8) (select (select .cse50 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_trim_pred_harness_~#cur~3#1.offset|))))))) (= (mod |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 256) 0)) is different from false Killed by 15