./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0 --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 df7033dfc83b180e9cf25def7ed6e49b1b8e99adfb4ac0289552069b1c368159 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 14:44:37,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 14:44:37,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 14:44:37,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 14:44:37,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 14:44:37,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 14:44:37,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 14:44:37,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 14:44:37,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 14:44:37,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 14:44:37,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 14:44:37,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 14:44:37,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 14:44:37,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 14:44:37,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 14:44:37,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 14:44:37,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 14:44:37,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 14:44:37,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 14:44:37,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 14:44:37,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 14:44:37,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 14:44:37,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 14:44:37,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 14:44:37,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 14:44:37,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 14:44:37,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 14:44:37,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 14:44:37,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 14:44:37,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 14:44:37,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 14:44:37,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 14:44:37,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 14:44:37,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 14:44:37,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 14:44:37,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 14:44:37,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 14:44:37,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 14:44:37,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 14:44:37,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 14:44:37,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 14:44:37,754 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 14:44:37,795 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 14:44:37,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 14:44:37,795 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 14:44:37,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 14:44:37,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 14:44:37,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 14:44:37,804 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 14:44:37,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 14:44:37,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 14:44:37,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 14:44:37,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 14:44:37,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 14:44:37,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 14:44:37,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 14:44:37,806 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 14:44:37,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 14:44:37,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 14:44:37,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 14:44:37,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 14:44:37,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 14:44:37,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 14:44:37,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 14:44:37,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 14:44:37,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 14:44:37,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 14:44:37,808 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 14:44:37,808 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 14:44:37,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 14:44:37,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 14:44:37,810 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0 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 -> df7033dfc83b180e9cf25def7ed6e49b1b8e99adfb4ac0289552069b1c368159 [2021-11-22 14:44:38,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 14:44:38,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 14:44:38,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 14:44:38,081 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 14:44:38,081 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 14:44:38,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i [2021-11-22 14:44:38,155 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/data/950877bc9/233b570e0b754cea8d9b185dd3e70426/FLAG40ae1d640 [2021-11-22 14:44:38,906 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 14:44:38,906 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i [2021-11-22 14:44:38,964 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/data/950877bc9/233b570e0b754cea8d9b185dd3e70426/FLAG40ae1d640 [2021-11-22 14:44:39,465 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/data/950877bc9/233b570e0b754cea8d9b185dd3e70426 [2021-11-22 14:44:39,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 14:44:39,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 14:44:39,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 14:44:39,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 14:44:39,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 14:44:39,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:44:39" (1/1) ... [2021-11-22 14:44:39,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7e93a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:39, skipping insertion in model container [2021-11-22 14:44:39,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:44:39" (1/1) ... [2021-11-22 14:44:39,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 14:44:39,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 14:44:39,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i[4504,4517] [2021-11-22 14:44:39,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i[4564,4577] [2021-11-22 14:44:41,105 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,106 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,107 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,108 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,109 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,122 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,123 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,124 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,125 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,543 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 14:44:41,551 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 14:44:41,552 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 14:44:41,554 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 14:44:41,555 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 14:44:41,556 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 14:44:41,557 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 14:44:41,557 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 14:44:41,558 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 14:44:41,558 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 14:44:41,744 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 14:44:41,867 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,868 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:41,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 14:44:42,021 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 14:44:42,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i[4504,4517] [2021-11-22 14:44:42,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i[4564,4577] [2021-11-22 14:44:42,068 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,068 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,069 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,069 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,070 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,076 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,077 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,078 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,078 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,110 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 14:44:42,111 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 14:44:42,112 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 14:44:42,115 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 14:44:42,116 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 14:44:42,117 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 14:44:42,118 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 14:44:42,118 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 14:44:42,119 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 14:44:42,119 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 14:44:42,161 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 14:44:42,265 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,266 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 14:44:42,305 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 14:44:42,572 INFO L208 MainTranslator]: Completed translation [2021-11-22 14:44:42,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42 WrapperNode [2021-11-22 14:44:42,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 14:44:42,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 14:44:42,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 14:44:42,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 14:44:42,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (1/1) ... [2021-11-22 14:44:42,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (1/1) ... [2021-11-22 14:44:42,838 INFO L137 Inliner]: procedures = 690, calls = 2620, calls flagged for inlining = 951, calls inlined = 30, statements flattened = 1115 [2021-11-22 14:44:42,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 14:44:42,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 14:44:42,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 14:44:42,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 14:44:42,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (1/1) ... [2021-11-22 14:44:42,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (1/1) ... [2021-11-22 14:44:42,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (1/1) ... [2021-11-22 14:44:42,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (1/1) ... [2021-11-22 14:44:42,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (1/1) ... [2021-11-22 14:44:42,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (1/1) ... [2021-11-22 14:44:42,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (1/1) ... [2021-11-22 14:44:42,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 14:44:42,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 14:44:42,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 14:44:42,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 14:44:42,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (1/1) ... [2021-11-22 14:44:42,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 14:44:43,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:44:43,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 14:44:43,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 14:44:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 14:44:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 14:44:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 14:44:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 14:44:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 14:44:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 14:44:43,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 14:44:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 14:44:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 14:44:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 14:44:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 14:44:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 14:44:43,336 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 14:44:43,349 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 14:44:44,796 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 14:44:44,810 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 14:44:44,811 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 14:44:44,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:44:44 BoogieIcfgContainer [2021-11-22 14:44:44,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 14:44:44,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 14:44:44,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 14:44:44,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 14:44:44,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:44:39" (1/3) ... [2021-11-22 14:44:44,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8c7b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:44:44, skipping insertion in model container [2021-11-22 14:44:44,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:44:42" (2/3) ... [2021-11-22 14:44:44,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8c7b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:44:44, skipping insertion in model container [2021-11-22 14:44:44,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:44:44" (3/3) ... [2021-11-22 14:44:44,822 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_left_trim_pred_harness.i [2021-11-22 14:44:44,827 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 14:44:44,827 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-22 14:44:44,871 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 14:44:44,877 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 14:44:44,877 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-22 14:44:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 123 states have internal predecessors, (171), 0 states have call successors, (0), 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 14:44:44,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-22 14:44:44,900 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:44,901 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] [2021-11-22 14:44:44,901 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:44,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash 960385600, now seen corresponding path program 1 times [2021-11-22 14:44:44,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:44,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620984483] [2021-11-22 14:44:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:44,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:45,433 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 14:44:45,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:45,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620984483] [2021-11-22 14:44:45,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620984483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:45,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:45,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:44:45,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225173002] [2021-11-22 14:44:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:45,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 14:44:45,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:45,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 14:44:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 14:44:45,469 INFO L87 Difference]: Start difference. First operand has 124 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 123 states have internal predecessors, (171), 0 states have call successors, (0), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:45,495 INFO L93 Difference]: Finished difference Result 244 states and 337 transitions. [2021-11-22 14:44:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 14:44:45,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-22 14:44:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:45,506 INFO L225 Difference]: With dead ends: 244 [2021-11-22 14:44:45,506 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 14:44:45,508 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 14:44:45,512 INFO L933 BasicCegarLoop]: 159 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, 159 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 14:44:45,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:44:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 14:44:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-22 14:44:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 116 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 14:44:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2021-11-22 14:44:45,551 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 30 [2021-11-22 14:44:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:45,551 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2021-11-22 14:44:45,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2021-11-22 14:44:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 14:44:45,553 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:45,553 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] [2021-11-22 14:44:45,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 14:44:45,554 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:45,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash -649638665, now seen corresponding path program 1 times [2021-11-22 14:44:45,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:45,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163227594] [2021-11-22 14:44:45,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:45,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:45,785 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 14:44:45,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:45,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163227594] [2021-11-22 14:44:45,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163227594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:45,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:45,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:44:45,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048554768] [2021-11-22 14:44:45,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:45,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:44:45,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:45,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:44:45,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:44:45,789 INFO L87 Difference]: Start difference. First operand 117 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:45,906 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2021-11-22 14:44:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:44:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-22 14:44:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:45,911 INFO L225 Difference]: With dead ends: 213 [2021-11-22 14:44:45,912 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 14:44:45,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:44:45,919 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 134 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:45,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 187 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:44:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 14:44:45,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-22 14:44:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3125) internal successors, (147), 116 states have internal predecessors, (147), 0 states have call successors, (0), 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 14:44:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2021-11-22 14:44:45,943 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 32 [2021-11-22 14:44:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:45,944 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2021-11-22 14:44:45,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2021-11-22 14:44:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 14:44:45,948 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:45,948 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] [2021-11-22 14:44:45,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 14:44:45,948 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:45,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:45,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1150788759, now seen corresponding path program 1 times [2021-11-22 14:44:45,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:45,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145735292] [2021-11-22 14:44:45,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:45,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:46,293 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 14:44:46,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:46,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145735292] [2021-11-22 14:44:46,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145735292] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:46,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:46,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 14:44:46,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584821508] [2021-11-22 14:44:46,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:46,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 14:44:46,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:46,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 14:44:46,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:44:46,300 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:46,414 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2021-11-22 14:44:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:44:46,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-22 14:44:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:46,418 INFO L225 Difference]: With dead ends: 174 [2021-11-22 14:44:46,419 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 14:44:46,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-22 14:44:46,427 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 579 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:46,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 215 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:44:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 14:44:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-22 14:44:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 116 states have internal predecessors, (146), 0 states have call successors, (0), 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 14:44:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2021-11-22 14:44:46,448 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 36 [2021-11-22 14:44:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:46,449 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2021-11-22 14:44:46,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2021-11-22 14:44:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 14:44:46,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:46,455 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] [2021-11-22 14:44:46,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 14:44:46,455 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:46,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:46,456 INFO L85 PathProgramCache]: Analyzing trace with hash 410162962, now seen corresponding path program 1 times [2021-11-22 14:44:46,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:46,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306232919] [2021-11-22 14:44:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:46,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:46,771 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 14:44:46,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:46,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306232919] [2021-11-22 14:44:46,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306232919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:46,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:46,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 14:44:46,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482532736] [2021-11-22 14:44:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:46,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:44:46,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:46,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:44:46,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:44:46,774 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:47,040 INFO L93 Difference]: Finished difference Result 216 states and 261 transitions. [2021-11-22 14:44:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 14:44:47,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-22 14:44:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:47,042 INFO L225 Difference]: With dead ends: 216 [2021-11-22 14:44:47,042 INFO L226 Difference]: Without dead ends: 208 [2021-11-22 14:44:47,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-22 14:44:47,044 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 176 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:47,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 570 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:44:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-22 14:44:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2021-11-22 14:44:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.265625) internal successors, (162), 132 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2021-11-22 14:44:47,057 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 38 [2021-11-22 14:44:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:47,057 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2021-11-22 14:44:47,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2021-11-22 14:44:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 14:44:47,059 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:47,059 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] [2021-11-22 14:44:47,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 14:44:47,059 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:47,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:47,060 INFO L85 PathProgramCache]: Analyzing trace with hash -235054390, now seen corresponding path program 1 times [2021-11-22 14:44:47,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:47,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131250284] [2021-11-22 14:44:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:47,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:47,553 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 14:44:47,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:47,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131250284] [2021-11-22 14:44:47,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131250284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:47,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:47,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 14:44:47,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790543643] [2021-11-22 14:44:47,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:47,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:44:47,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:47,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:44:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:44:47,556 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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 14:44:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:48,392 INFO L93 Difference]: Finished difference Result 399 states and 482 transitions. [2021-11-22 14:44:48,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 14:44:48,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2021-11-22 14:44:48,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:48,395 INFO L225 Difference]: With dead ends: 399 [2021-11-22 14:44:48,395 INFO L226 Difference]: Without dead ends: 292 [2021-11-22 14:44:48,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-22 14:44:48,397 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 531 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:48,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 701 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 14:44:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-22 14:44:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 207. [2021-11-22 14:44:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2425742574257426) internal successors, (251), 206 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 14:44:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2021-11-22 14:44:48,416 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 42 [2021-11-22 14:44:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:48,417 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2021-11-22 14:44:48,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 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 14:44:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2021-11-22 14:44:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-22 14:44:48,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:48,418 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 14:44:48,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 14:44:48,419 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash 324843685, now seen corresponding path program 1 times [2021-11-22 14:44:48,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:48,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739610792] [2021-11-22 14:44:48,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:48,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:48,612 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 14:44:48,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:48,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739610792] [2021-11-22 14:44:48,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739610792] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:48,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:48,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:44:48,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421923861] [2021-11-22 14:44:48,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:48,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:44:48,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:48,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:44:48,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:44:48,615 INFO L87 Difference]: Start difference. First operand 207 states and 251 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 14:44:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:48,669 INFO L93 Difference]: Finished difference Result 264 states and 317 transitions. [2021-11-22 14:44:48,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 14:44:48,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 14:44:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:48,671 INFO L225 Difference]: With dead ends: 264 [2021-11-22 14:44:48,671 INFO L226 Difference]: Without dead ends: 207 [2021-11-22 14:44:48,672 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 14:44:48,673 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 102 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:48,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 286 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:44:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-22 14:44:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-22 14:44:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2326732673267327) internal successors, (249), 206 states have internal predecessors, (249), 0 states have call successors, (0), 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 14:44:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2021-11-22 14:44:48,687 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 43 [2021-11-22 14:44:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:48,688 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2021-11-22 14:44:48,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 14:44:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2021-11-22 14:44:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-22 14:44:48,689 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:48,690 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] [2021-11-22 14:44:48,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 14:44:48,690 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:48,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:48,691 INFO L85 PathProgramCache]: Analyzing trace with hash 495838041, now seen corresponding path program 1 times [2021-11-22 14:44:48,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:48,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430912385] [2021-11-22 14:44:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:48,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:48,832 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 14:44:48,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:48,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430912385] [2021-11-22 14:44:48,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430912385] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:48,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:48,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:44:48,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746991315] [2021-11-22 14:44:48,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:48,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:44:48,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:48,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:44:48,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:44:48,835 INFO L87 Difference]: Start difference. First operand 207 states and 249 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 14:44:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:48,856 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2021-11-22 14:44:48,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:44:48,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 14:44:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:48,860 INFO L225 Difference]: With dead ends: 298 [2021-11-22 14:44:48,860 INFO L226 Difference]: Without dead ends: 210 [2021-11-22 14:44:48,861 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 14:44:48,863 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 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 14:44:48,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:44:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-22 14:44:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-11-22 14:44:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2292682926829268) internal successors, (252), 209 states have internal predecessors, (252), 0 states have call successors, (0), 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 14:44:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2021-11-22 14:44:48,882 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 45 [2021-11-22 14:44:48,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:48,882 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2021-11-22 14:44:48,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 14:44:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2021-11-22 14:44:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-22 14:44:48,889 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:48,889 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] [2021-11-22 14:44:48,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 14:44:48,889 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:48,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2004884674, now seen corresponding path program 1 times [2021-11-22 14:44:48,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:48,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088881787] [2021-11-22 14:44:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:48,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:49,196 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 14:44:49,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:49,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088881787] [2021-11-22 14:44:49,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088881787] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:49,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:49,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 14:44:49,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104725188] [2021-11-22 14:44:49,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:49,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 14:44:49,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:49,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 14:44:49,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:44:49,199 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 14:44:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:49,427 INFO L93 Difference]: Finished difference Result 433 states and 511 transitions. [2021-11-22 14:44:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 14:44:49,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-22 14:44:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:49,429 INFO L225 Difference]: With dead ends: 433 [2021-11-22 14:44:49,429 INFO L226 Difference]: Without dead ends: 262 [2021-11-22 14:44:49,429 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 14:44:49,430 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 84 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:49,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 678 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:44:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-22 14:44:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 210. [2021-11-22 14:44:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 209 states have internal predecessors, (250), 0 states have call successors, (0), 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 14:44:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 250 transitions. [2021-11-22 14:44:49,441 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 250 transitions. Word has length 46 [2021-11-22 14:44:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:49,441 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 250 transitions. [2021-11-22 14:44:49,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 14:44:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2021-11-22 14:44:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-22 14:44:49,443 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:49,443 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] [2021-11-22 14:44:49,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 14:44:49,443 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash -954265451, now seen corresponding path program 1 times [2021-11-22 14:44:49,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:49,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366787939] [2021-11-22 14:44:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:49,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:49,819 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 14:44:49,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:49,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366787939] [2021-11-22 14:44:49,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366787939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:49,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:49,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 14:44:49,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874956444] [2021-11-22 14:44:49,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:49,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:44:49,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:49,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:44:49,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:44:49,821 INFO L87 Difference]: Start difference. First operand 210 states and 250 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 14:44:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:50,410 INFO L93 Difference]: Finished difference Result 412 states and 485 transitions. [2021-11-22 14:44:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 14:44:50,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 14:44:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:50,413 INFO L225 Difference]: With dead ends: 412 [2021-11-22 14:44:50,413 INFO L226 Difference]: Without dead ends: 292 [2021-11-22 14:44:50,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2021-11-22 14:44:50,414 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 623 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:50,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 591 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 14:44:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-22 14:44:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 207. [2021-11-22 14:44:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2128712871287128) internal successors, (245), 206 states have internal predecessors, (245), 0 states have call successors, (0), 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 14:44:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 245 transitions. [2021-11-22 14:44:50,426 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 245 transitions. Word has length 47 [2021-11-22 14:44:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:50,426 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 245 transitions. [2021-11-22 14:44:50,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 14:44:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 245 transitions. [2021-11-22 14:44:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 14:44:50,427 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:50,428 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] [2021-11-22 14:44:50,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 14:44:50,428 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:50,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:50,429 INFO L85 PathProgramCache]: Analyzing trace with hash 93394749, now seen corresponding path program 1 times [2021-11-22 14:44:50,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:50,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104197242] [2021-11-22 14:44:50,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:50,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:50,622 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 14:44:50,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:50,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104197242] [2021-11-22 14:44:50,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104197242] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:50,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:50,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:44:50,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539172666] [2021-11-22 14:44:50,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:50,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:44:50,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:50,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:44:50,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:44:50,625 INFO L87 Difference]: Start difference. First operand 207 states and 245 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:50,924 INFO L93 Difference]: Finished difference Result 400 states and 473 transitions. [2021-11-22 14:44:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 14:44:50,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-22 14:44:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:50,926 INFO L225 Difference]: With dead ends: 400 [2021-11-22 14:44:50,926 INFO L226 Difference]: Without dead ends: 233 [2021-11-22 14:44:50,927 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 14:44:50,927 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 103 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:50,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 328 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 14:44:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-22 14:44:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 207. [2021-11-22 14:44:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.1732673267326732) internal successors, (237), 206 states have internal predecessors, (237), 0 states have call successors, (0), 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 14:44:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 237 transitions. [2021-11-22 14:44:50,939 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 237 transitions. Word has length 48 [2021-11-22 14:44:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:50,940 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 237 transitions. [2021-11-22 14:44:50,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 237 transitions. [2021-11-22 14:44:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 14:44:50,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:50,941 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] [2021-11-22 14:44:50,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 14:44:50,941 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:50,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2144378747, now seen corresponding path program 1 times [2021-11-22 14:44:50,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:50,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305944948] [2021-11-22 14:44:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:50,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:51,247 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 14:44:51,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:51,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305944948] [2021-11-22 14:44:51,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305944948] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:51,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:51,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:44:51,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896433819] [2021-11-22 14:44:51,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:51,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 14:44:51,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:51,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 14:44:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:44:51,250 INFO L87 Difference]: Start difference. First operand 207 states and 237 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:52,035 INFO L93 Difference]: Finished difference Result 542 states and 620 transitions. [2021-11-22 14:44:52,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 14:44:52,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-22 14:44:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:52,039 INFO L225 Difference]: With dead ends: 542 [2021-11-22 14:44:52,039 INFO L226 Difference]: Without dead ends: 478 [2021-11-22 14:44:52,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-22 14:44:52,040 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 524 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:52,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 689 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 14:44:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-11-22 14:44:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 193. [2021-11-22 14:44:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.1648936170212767) internal successors, (219), 192 states have internal predecessors, (219), 0 states have call successors, (0), 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 14:44:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 219 transitions. [2021-11-22 14:44:52,056 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 219 transitions. Word has length 48 [2021-11-22 14:44:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:52,056 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 219 transitions. [2021-11-22 14:44:52,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 219 transitions. [2021-11-22 14:44:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-22 14:44:52,057 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:52,058 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] [2021-11-22 14:44:52,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 14:44:52,058 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:52,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:52,059 INFO L85 PathProgramCache]: Analyzing trace with hash 870337434, now seen corresponding path program 1 times [2021-11-22 14:44:52,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:52,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037204954] [2021-11-22 14:44:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:52,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:52,239 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 14:44:52,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:52,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037204954] [2021-11-22 14:44:52,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037204954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:52,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:52,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:44:52,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902322195] [2021-11-22 14:44:52,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:52,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:44:52,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:52,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:44:52,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:44:52,242 INFO L87 Difference]: Start difference. First operand 193 states and 219 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 14:44:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:52,471 INFO L93 Difference]: Finished difference Result 353 states and 402 transitions. [2021-11-22 14:44:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:44:52,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-11-22 14:44:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:52,473 INFO L225 Difference]: With dead ends: 353 [2021-11-22 14:44:52,473 INFO L226 Difference]: Without dead ends: 193 [2021-11-22 14:44:52,473 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 14:44:52,474 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 46 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:52,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 214 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:44:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-22 14:44:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-11-22 14:44:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.127659574468085) internal successors, (212), 192 states have internal predecessors, (212), 0 states have call successors, (0), 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 14:44:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 212 transitions. [2021-11-22 14:44:52,486 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 212 transitions. Word has length 49 [2021-11-22 14:44:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:52,487 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 212 transitions. [2021-11-22 14:44:52,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 14:44:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 212 transitions. [2021-11-22 14:44:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-22 14:44:52,488 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:52,488 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] [2021-11-22 14:44:52,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 14:44:52,488 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:52,489 INFO L85 PathProgramCache]: Analyzing trace with hash 190279064, now seen corresponding path program 1 times [2021-11-22 14:44:52,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:52,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495829330] [2021-11-22 14:44:52,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:52,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:52,811 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 14:44:52,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:52,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495829330] [2021-11-22 14:44:52,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495829330] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:52,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:52,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 14:44:52,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526743927] [2021-11-22 14:44:52,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:52,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 14:44:52,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:52,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 14:44:52,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-22 14:44:52,813 INFO L87 Difference]: Start difference. First operand 193 states and 212 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 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 14:44:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:53,635 INFO L93 Difference]: Finished difference Result 313 states and 339 transitions. [2021-11-22 14:44:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 14:44:53,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-11-22 14:44:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:53,637 INFO L225 Difference]: With dead ends: 313 [2021-11-22 14:44:53,637 INFO L226 Difference]: Without dead ends: 268 [2021-11-22 14:44:53,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2021-11-22 14:44:53,638 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 513 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:53,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 551 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 14:44:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-22 14:44:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 204. [2021-11-22 14:44:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.120603015075377) internal successors, (223), 203 states have internal predecessors, (223), 0 states have call successors, (0), 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 14:44:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 223 transitions. [2021-11-22 14:44:53,652 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 223 transitions. Word has length 49 [2021-11-22 14:44:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:53,652 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 223 transitions. [2021-11-22 14:44:53,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 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 14:44:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 223 transitions. [2021-11-22 14:44:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 14:44:53,654 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:53,654 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] [2021-11-22 14:44:53,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 14:44:53,654 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:53,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash 482349700, now seen corresponding path program 1 times [2021-11-22 14:44:53,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:53,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554307448] [2021-11-22 14:44:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:53,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:54,007 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 14:44:54,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:54,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554307448] [2021-11-22 14:44:54,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554307448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:54,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:54,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:44:54,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884778481] [2021-11-22 14:44:54,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:54,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 14:44:54,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:54,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 14:44:54,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:44:54,010 INFO L87 Difference]: Start difference. First operand 204 states and 223 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 14:44:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:54,616 INFO L93 Difference]: Finished difference Result 603 states and 662 transitions. [2021-11-22 14:44:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 14:44:54,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-22 14:44:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:54,619 INFO L225 Difference]: With dead ends: 603 [2021-11-22 14:44:54,619 INFO L226 Difference]: Without dead ends: 483 [2021-11-22 14:44:54,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-11-22 14:44:54,620 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 953 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:54,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 451 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 14:44:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-11-22 14:44:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 201. [2021-11-22 14:44:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.1122448979591837) internal successors, (218), 200 states have internal predecessors, (218), 0 states have call successors, (0), 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 14:44:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2021-11-22 14:44:54,637 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 53 [2021-11-22 14:44:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:54,638 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2021-11-22 14:44:54,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 14:44:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2021-11-22 14:44:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-22 14:44:54,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:54,639 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] [2021-11-22 14:44:54,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 14:44:54,639 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1409745750, now seen corresponding path program 1 times [2021-11-22 14:44:54,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:54,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517246616] [2021-11-22 14:44:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:54,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:54,913 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 14:44:54,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:54,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517246616] [2021-11-22 14:44:54,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517246616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:54,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:54,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:44:54,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770734695] [2021-11-22 14:44:54,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:54,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 14:44:54,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 14:44:54,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:44:54,916 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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 14:44:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:55,532 INFO L93 Difference]: Finished difference Result 566 states and 618 transitions. [2021-11-22 14:44:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 14:44:55,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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 14:44:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:55,536 INFO L225 Difference]: With dead ends: 566 [2021-11-22 14:44:55,536 INFO L226 Difference]: Without dead ends: 482 [2021-11-22 14:44:55,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-11-22 14:44:55,537 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 774 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:55,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 665 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 14:44:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-11-22 14:44:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 203. [2021-11-22 14:44:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.1111111111111112) internal successors, (220), 202 states have internal predecessors, (220), 0 states have call successors, (0), 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 14:44:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 220 transitions. [2021-11-22 14:44:55,553 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 220 transitions. Word has length 54 [2021-11-22 14:44:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:55,554 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 220 transitions. [2021-11-22 14:44:55,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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 14:44:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 220 transitions. [2021-11-22 14:44:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-22 14:44:55,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:55,555 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 14:44:55,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 14:44:55,555 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2092937159, now seen corresponding path program 1 times [2021-11-22 14:44:55,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:55,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237450541] [2021-11-22 14:44:55,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:55,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:55,819 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 14:44:55,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:55,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237450541] [2021-11-22 14:44:55,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237450541] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:55,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:55,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 14:44:55,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627537256] [2021-11-22 14:44:55,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:55,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:44:55,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:55,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:44:55,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:44:55,821 INFO L87 Difference]: Start difference. First operand 203 states and 220 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 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 14:44:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:56,649 INFO L93 Difference]: Finished difference Result 502 states and 544 transitions. [2021-11-22 14:44:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 14:44:56,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 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 14:44:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:56,652 INFO L225 Difference]: With dead ends: 502 [2021-11-22 14:44:56,652 INFO L226 Difference]: Without dead ends: 457 [2021-11-22 14:44:56,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2021-11-22 14:44:56,654 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 915 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:56,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [915 Valid, 483 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 14:44:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-22 14:44:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 173. [2021-11-22 14:44:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.1130952380952381) internal successors, (187), 172 states have internal predecessors, (187), 0 states have call successors, (0), 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 14:44:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2021-11-22 14:44:56,668 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 55 [2021-11-22 14:44:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:56,668 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2021-11-22 14:44:56,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 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 14:44:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2021-11-22 14:44:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-22 14:44:56,672 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:56,673 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] [2021-11-22 14:44:56,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 14:44:56,673 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash 485245166, now seen corresponding path program 1 times [2021-11-22 14:44:56,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:56,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153829835] [2021-11-22 14:44:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:56,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:57,060 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 14:44:57,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:57,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153829835] [2021-11-22 14:44:57,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153829835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:57,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:57,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 14:44:57,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353041423] [2021-11-22 14:44:57,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:57,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:44:57,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:57,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:44:57,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:44:57,063 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 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 14:44:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:57,410 INFO L93 Difference]: Finished difference Result 393 states and 422 transitions. [2021-11-22 14:44:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 14:44:57,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 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 14:44:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:57,412 INFO L225 Difference]: With dead ends: 393 [2021-11-22 14:44:57,412 INFO L226 Difference]: Without dead ends: 243 [2021-11-22 14:44:57,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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 14:44:57,413 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 293 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:57,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 540 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:44:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-22 14:44:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 177. [2021-11-22 14:44:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.1104651162790697) internal successors, (191), 176 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2021-11-22 14:44:57,428 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 56 [2021-11-22 14:44:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:57,428 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2021-11-22 14:44:57,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 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 14:44:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2021-11-22 14:44:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-22 14:44:57,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:57,429 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 14:44:57,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 14:44:57,430 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:57,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1309942923, now seen corresponding path program 1 times [2021-11-22 14:44:57,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:57,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490276188] [2021-11-22 14:44:57,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:57,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:57,604 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 14:44:57,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:57,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490276188] [2021-11-22 14:44:57,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490276188] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:57,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:57,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:44:57,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387329194] [2021-11-22 14:44:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:57,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:44:57,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:57,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:44:57,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:44:57,606 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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 14:44:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:57,648 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2021-11-22 14:44:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 14:44:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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 14:44:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:57,650 INFO L225 Difference]: With dead ends: 188 [2021-11-22 14:44:57,650 INFO L226 Difference]: Without dead ends: 177 [2021-11-22 14:44:57,650 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 14:44:57,651 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 116 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:57,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 212 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:44:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-22 14:44:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-22 14:44:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.1046511627906976) internal successors, (190), 176 states have internal predecessors, (190), 0 states have call successors, (0), 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 14:44:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2021-11-22 14:44:57,670 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 58 [2021-11-22 14:44:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:57,670 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2021-11-22 14:44:57,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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 14:44:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2021-11-22 14:44:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-22 14:44:57,671 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:57,672 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] [2021-11-22 14:44:57,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 14:44:57,672 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1050364765, now seen corresponding path program 1 times [2021-11-22 14:44:57,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:57,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719987239] [2021-11-22 14:44:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:57,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:44:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:44:58,434 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 14:44:58,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:44:58,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719987239] [2021-11-22 14:44:58,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719987239] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:44:58,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:44:58,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 14:44:58,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578639490] [2021-11-22 14:44:58,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:44:58,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 14:44:58,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:44:58,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 14:44:58,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-22 14:44:58,436 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:44:59,828 INFO L93 Difference]: Finished difference Result 454 states and 486 transitions. [2021-11-22 14:44:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 14:44:59,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-22 14:44:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:44:59,831 INFO L225 Difference]: With dead ends: 454 [2021-11-22 14:44:59,831 INFO L226 Difference]: Without dead ends: 319 [2021-11-22 14:44:59,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2021-11-22 14:44:59,832 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 697 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 14:44:59,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [697 Valid, 734 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 14:44:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-11-22 14:44:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 177. [2021-11-22 14:44:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0988372093023255) internal successors, (189), 176 states have internal predecessors, (189), 0 states have call successors, (0), 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 14:44:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2021-11-22 14:44:59,848 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 59 [2021-11-22 14:44:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:44:59,849 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2021-11-22 14:44:59,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:44:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2021-11-22 14:44:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 14:44:59,850 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:44:59,850 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] [2021-11-22 14:44:59,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 14:44:59,851 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:44:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:44:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1944530334, now seen corresponding path program 1 times [2021-11-22 14:44:59,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:44:59,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17456027] [2021-11-22 14:44:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:44:59,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:45:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:45:00,679 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 14:45:00,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:45:00,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17456027] [2021-11-22 14:45:00,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17456027] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:45:00,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:45:00,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 14:45:00,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280460176] [2021-11-22 14:45:00,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:45:00,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 14:45:00,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:45:00,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 14:45:00,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-22 14:45:00,681 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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 14:45:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:45:01,767 INFO L93 Difference]: Finished difference Result 425 states and 451 transitions. [2021-11-22 14:45:01,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-22 14:45:01,768 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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 14:45:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:45:01,770 INFO L225 Difference]: With dead ends: 425 [2021-11-22 14:45:01,770 INFO L226 Difference]: Without dead ends: 354 [2021-11-22 14:45:01,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-11-22 14:45:01,772 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 674 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 14:45:01,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [674 Valid, 1326 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 14:45:01,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-22 14:45:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 221. [2021-11-22 14:45:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 220 states have internal predecessors, (240), 0 states have call successors, (0), 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 14:45:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 240 transitions. [2021-11-22 14:45:01,793 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 240 transitions. Word has length 62 [2021-11-22 14:45:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:45:01,793 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 240 transitions. [2021-11-22 14:45:01,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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 14:45:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 240 transitions. [2021-11-22 14:45:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 14:45:01,795 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:45:01,795 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 14:45:01,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 14:45:01,795 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:45:01,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:45:01,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1831062709, now seen corresponding path program 1 times [2021-11-22 14:45:01,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:45:01,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313043027] [2021-11-22 14:45:01,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:45:01,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:45:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:45:02,135 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 14:45:02,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:45:02,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313043027] [2021-11-22 14:45:02,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313043027] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:45:02,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:45:02,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 14:45:02,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195271021] [2021-11-22 14:45:02,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:45:02,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:45:02,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:45:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:45:02,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:45:02,137 INFO L87 Difference]: Start difference. First operand 221 states and 240 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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 14:45:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:45:02,539 INFO L93 Difference]: Finished difference Result 278 states and 298 transitions. [2021-11-22 14:45:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:45:02,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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 14:45:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:45:02,541 INFO L225 Difference]: With dead ends: 278 [2021-11-22 14:45:02,541 INFO L226 Difference]: Without dead ends: 268 [2021-11-22 14:45:02,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:45:02,542 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 66 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:45:02,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 471 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:45:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-22 14:45:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2021-11-22 14:45:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.0957854406130267) internal successors, (286), 265 states have internal predecessors, (286), 0 states have call successors, (0), 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 14:45:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 286 transitions. [2021-11-22 14:45:02,569 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 286 transitions. Word has length 64 [2021-11-22 14:45:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:45:02,569 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 286 transitions. [2021-11-22 14:45:02,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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 14:45:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 286 transitions. [2021-11-22 14:45:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 14:45:02,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:45:02,571 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 14:45:02,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 14:45:02,571 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:45:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:45:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2002093992, now seen corresponding path program 1 times [2021-11-22 14:45:02,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:45:02,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955237826] [2021-11-22 14:45:02,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:45:02,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:45:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:45:02,928 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 14:45:02,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:45:02,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955237826] [2021-11-22 14:45:02,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955237826] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:45:02,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:45:02,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 14:45:02,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883736777] [2021-11-22 14:45:02,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:45:02,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 14:45:02,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:45:02,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 14:45:02,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-22 14:45:02,952 INFO L87 Difference]: Start difference. First operand 266 states and 286 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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 14:45:04,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:45:04,106 INFO L93 Difference]: Finished difference Result 293 states and 313 transitions. [2021-11-22 14:45:04,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 14:45:04,108 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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 14:45:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:45:04,110 INFO L225 Difference]: With dead ends: 293 [2021-11-22 14:45:04,110 INFO L226 Difference]: Without dead ends: 233 [2021-11-22 14:45:04,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2021-11-22 14:45:04,111 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 461 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 14:45:04,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 709 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 14:45:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-22 14:45:04,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 208. [2021-11-22 14:45:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.1083743842364533) internal successors, (225), 207 states have internal predecessors, (225), 0 states have call successors, (0), 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 14:45:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2021-11-22 14:45:04,133 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 64 [2021-11-22 14:45:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:45:04,134 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2021-11-22 14:45:04,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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 14:45:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2021-11-22 14:45:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 14:45:04,135 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:45:04,135 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 14:45:04,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 14:45:04,136 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:45:04,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:45:04,136 INFO L85 PathProgramCache]: Analyzing trace with hash 690621047, now seen corresponding path program 1 times [2021-11-22 14:45:04,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:45:04,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774148841] [2021-11-22 14:45:04,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:45:04,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:45:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:45:04,369 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 14:45:04,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:45:04,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774148841] [2021-11-22 14:45:04,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774148841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:45:04,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:45:04,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 14:45:04,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54228584] [2021-11-22 14:45:04,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:45:04,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 14:45:04,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:45:04,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 14:45:04,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-22 14:45:04,371 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 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 14:45:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:45:05,315 INFO L93 Difference]: Finished difference Result 325 states and 348 transitions. [2021-11-22 14:45:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 14:45:05,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 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 14:45:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:45:05,318 INFO L225 Difference]: With dead ends: 325 [2021-11-22 14:45:05,318 INFO L226 Difference]: Without dead ends: 317 [2021-11-22 14:45:05,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-22 14:45:05,319 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 327 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 14:45:05,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 531 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 14:45:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-22 14:45:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 209. [2021-11-22 14:45:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 204 states have (on average 1.1029411764705883) internal successors, (225), 208 states have internal predecessors, (225), 0 states have call successors, (0), 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 14:45:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 225 transitions. [2021-11-22 14:45:05,342 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 225 transitions. Word has length 64 [2021-11-22 14:45:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:45:05,342 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 225 transitions. [2021-11-22 14:45:05,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 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 14:45:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 225 transitions. [2021-11-22 14:45:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-22 14:45:05,344 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:45:05,344 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] [2021-11-22 14:45:05,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 14:45:05,344 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:45:05,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:45:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1188769797, now seen corresponding path program 1 times [2021-11-22 14:45:05,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:45:05,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651169421] [2021-11-22 14:45:05,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:45:05,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:45:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:45:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:45:06,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:45:06,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651169421] [2021-11-22 14:45:06,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651169421] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:45:06,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934455005] [2021-11-22 14:45:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:45:06,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:45:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:45:06,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:45:06,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 14:45:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:45:06,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 2562 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-22 14:45:06,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:45:06,892 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 14:45:07,030 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 14:45:07,031 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 14:45:07,164 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 25 treesize of output 21 [2021-11-22 14:45:07,432 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-11-22 14:45:07,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-11-22 14:45:07,498 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 40 treesize of output 20 [2021-11-22 14:45:07,553 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-11-22 14:45:07,554 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 48 treesize of output 24 [2021-11-22 14:45:07,859 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-22 14:45:07,860 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 42 treesize of output 50 [2021-11-22 14:45:07,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:45:07,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:45:07,928 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 17 treesize of output 17 [2021-11-22 14:45:08,253 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:45:08,254 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 35 treesize of output 31 [2021-11-22 14:45:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 14:45:08,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:45:08,581 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-22 14:45:08,582 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 19 treesize of output 18 [2021-11-22 14:45:10,672 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) (not (= (select (select (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_DerPreprocessor_2)) (.cse1 (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8))) (store .cse0 .cse1 (select .cse0 .cse1)))) |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)))) is different from false [2021-11-22 14:45:12,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |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 (= (select (select (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_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) |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)))) is different from false [2021-11-22 14:45:14,988 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= (select (select (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_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0)))) is different from false [2021-11-22 14:45:17,030 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) v_DerPreprocessor_3)))) (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_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0)))) is different from false [2021-11-22 14:45:19,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_4) (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) v_DerPreprocessor_3)))) (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_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0)))) is different from false [2021-11-22 14:45:21,309 INFO L354 Elim1Store]: treesize reduction 184, result has 32.8 percent of original size [2021-11-22 14:45:21,310 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 191544 treesize of output 123281 [2021-11-22 14:45:23,103 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:45:23,103 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 127359 treesize of output 121771 [2021-11-22 14:45:28,540 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 14:45:28,633 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 14:45:28,685 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:45:28,685 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 32 treesize of output 36 [2021-11-22 14:45:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-22 14:45:29,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934455005] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:45:29,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:45:29,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 20] total 43 [2021-11-22 14:45:29,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818203319] [2021-11-22 14:45:29,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:45:29,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-22 14:45:29,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:45:29,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-22 14:45:29,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1252, Unknown=5, NotChecked=380, Total=1806 [2021-11-22 14:45:29,797 INFO L87 Difference]: Start difference. First operand 209 states and 225 transitions. Second operand has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 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 14:45:32,192 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base|) 8)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) (.cse2 (select .cse3 8))) (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 1) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse1) 0) (= (select |c_#valid| |c_ULTIMATE.start_bounded_malloc_#res#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= |c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#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)) (not (= .cse2 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.offset| 0) (not (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| .cse0)) (= |c_ULTIMATE.start_save_byte_from_array_~array#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (= (select .cse3 .cse1) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse2)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_4) (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) v_DerPreprocessor_3)))) (store .cse4 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse5 (store (select .cse4 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_DerPreprocessor_2))) (store .cse5 8 (select .cse5 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0))))))) is different from false [2021-11-22 14:45:34,195 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 8))) (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_4) (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) v_DerPreprocessor_3)))) (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_DerPreprocessor_2))) (store .cse2 8 (select .cse2 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0)))))) is different from false [2021-11-22 14:45:36,200 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 8))) (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) v_DerPreprocessor_3)))) (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_DerPreprocessor_2))) (store .cse2 8 (select .cse2 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0)))))) is different from false [2021-11-22 14:45:38,202 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) 8))) (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (not (= .cse0 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= 0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)) 0)))) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|)))) is different from false [2021-11-22 14:45:40,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|))) (let ((.cse0 (select .cse2 8))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |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 (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8)))) |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)))) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) (not (= (select .cse2 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) 0))))) is different from false [2021-11-22 14:45:42,212 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 8))) (and (not (= .cse0 0)) (= |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_DerPreprocessor_2 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (= |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 (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8)))) |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)))) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)))) is different from false [2021-11-22 14:45:44,246 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 8))) (and (not (= .cse0 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 (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (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_DerPreprocessor_2)) (.cse2 (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8))) (store .cse1 .cse2 (select .cse1 .cse2)))) |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)))))) is different from false [2021-11-22 14:45:46,260 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) 8))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset| 0) (or (and (not |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#t~short991#1|) (exists ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int)) (<= (mod (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0) 18446744073709551616) 0))) (and (exists ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int)) (< 0 (mod (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base|) 0) 18446744073709551616))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#t~short991#1|)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.base|) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base| (let ((.cse1 (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_DerPreprocessor_2)) (.cse2 (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.offset| 8))) (store .cse1 .cse2 (select .cse1 .cse2)))) |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)))))) is different from false [2021-11-22 14:45:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:45:47,086 INFO L93 Difference]: Finished difference Result 379 states and 407 transitions. [2021-11-22 14:45:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-22 14:45:47,087 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 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 65 [2021-11-22 14:45:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:45:47,089 INFO L225 Difference]: With dead ends: 379 [2021-11-22 14:45:47,089 INFO L226 Difference]: Without dead ends: 305 [2021-11-22 14:45:47,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=407, Invalid=2388, Unknown=13, NotChecked=1482, Total=4290 [2021-11-22 14:45:47,092 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 262 mSDsluCounter, 2657 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1122 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 14:45:47,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 2809 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 978 Invalid, 0 Unknown, 1122 Unchecked, 0.7s Time] [2021-11-22 14:45:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-11-22 14:45:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 202. [2021-11-22 14:45:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.095959595959596) internal successors, (217), 201 states have internal predecessors, (217), 0 states have call successors, (0), 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 14:45:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2021-11-22 14:45:47,111 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 65 [2021-11-22 14:45:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:45:47,112 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2021-11-22 14:45:47,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 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 14:45:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2021-11-22 14:45:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 14:45:47,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:45:47,113 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] [2021-11-22 14:45:47,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 14:45:47,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:45:47,342 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:45:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:45:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash -23690172, now seen corresponding path program 1 times [2021-11-22 14:45:47,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:45:47,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285321848] [2021-11-22 14:45:47,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:45:47,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:45:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:45:47,602 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 14:45:47,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:45:47,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285321848] [2021-11-22 14:45:47,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285321848] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:45:47,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:45:47,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:45:47,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307465841] [2021-11-22 14:45:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:45:47,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 14:45:47,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:45:47,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 14:45:47,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:45:47,606 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:45:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:45:47,973 INFO L93 Difference]: Finished difference Result 337 states and 361 transitions. [2021-11-22 14:45:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 14:45:47,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-22 14:45:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:45:47,975 INFO L225 Difference]: With dead ends: 337 [2021-11-22 14:45:47,975 INFO L226 Difference]: Without dead ends: 273 [2021-11-22 14:45:47,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-22 14:45:47,976 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 197 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 14:45:47,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 513 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 14:45:47,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-22 14:45:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 202. [2021-11-22 14:45:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.0909090909090908) internal successors, (216), 201 states have internal predecessors, (216), 0 states have call successors, (0), 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 14:45:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2021-11-22 14:45:47,996 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 69 [2021-11-22 14:45:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:45:47,996 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2021-11-22 14:45:47,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:45:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2021-11-22 14:45:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 14:45:47,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:45:47,998 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] [2021-11-22 14:45:47,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 14:45:47,999 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:45:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:45:47,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1058361341, now seen corresponding path program 1 times [2021-11-22 14:45:47,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:45:48,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999053289] [2021-11-22 14:45:48,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:45:48,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:45:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:45:48,251 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 14:45:48,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:45:48,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999053289] [2021-11-22 14:45:48,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999053289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:45:48,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:45:48,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 14:45:48,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206650403] [2021-11-22 14:45:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:45:48,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:45:48,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:45:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:45:48,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:45:48,254 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:45:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:45:48,494 INFO L93 Difference]: Finished difference Result 288 states and 308 transitions. [2021-11-22 14:45:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 14:45:48,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-22 14:45:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:45:48,504 INFO L225 Difference]: With dead ends: 288 [2021-11-22 14:45:48,504 INFO L226 Difference]: Without dead ends: 224 [2021-11-22 14:45:48,504 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 14:45:48,505 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 47 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:45:48,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 375 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:45:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-22 14:45:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2021-11-22 14:45:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 214 states have (on average 1.088785046728972) internal successors, (233), 217 states have internal predecessors, (233), 0 states have call successors, (0), 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 14:45:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2021-11-22 14:45:48,527 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 72 [2021-11-22 14:45:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:45:48,528 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2021-11-22 14:45:48,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:45:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2021-11-22 14:45:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-22 14:45:48,529 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:45:48,529 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] [2021-11-22 14:45:48,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 14:45:48,530 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:45:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:45:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1034320377, now seen corresponding path program 1 times [2021-11-22 14:45:48,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:45:48,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158547588] [2021-11-22 14:45:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:45:48,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:45:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:45:49,383 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 14:45:49,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:45:49,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158547588] [2021-11-22 14:45:49,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158547588] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:45:49,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783815005] [2021-11-22 14:45:49,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:45:49,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:45:49,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:45:49,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:45:49,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 14:45:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:45:49,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-22 14:45:49,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:45:49,918 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 14:45:50,046 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 14:45:50,046 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 14:45:50,165 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 14:45:50,320 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 14:45:50,320 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 14:45:50,369 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 25 treesize of output 13 [2021-11-22 14:45:50,397 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-11-22 14:45:50,398 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 17 [2021-11-22 14:45:50,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:45:50,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:45:50,635 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 14:45:50,636 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 57 treesize of output 44 [2021-11-22 14:45:50,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:45:50,649 INFO L354 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2021-11-22 14:45:50,650 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 38 treesize of output 29 [2021-11-22 14:45:50,874 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 14:45:50,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:45:59,206 INFO L354 Elim1Store]: treesize reduction 270, result has 33.7 percent of original size [2021-11-22 14:45:59,207 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 26935 treesize of output 25758 [2021-11-22 14:46:00,870 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:46:00,871 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 24352 treesize of output 22600 [2021-11-22 14:46:11,588 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 14:46:14,718 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 14:46:14,719 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 14:46:14,761 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 14:46:14,778 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 14:46:14,857 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 22 [2021-11-22 14:46:17,359 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 14:46:17,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783815005] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:46:17,360 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:46:17,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 16] total 45 [2021-11-22 14:46:17,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207901789] [2021-11-22 14:46:17,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:46:17,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-22 14:46:17,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:17,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-22 14:46:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1814, Unknown=5, NotChecked=0, Total=1980 [2021-11-22 14:46:17,362 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand has 45 states, 45 states have (on average 4.5777777777777775) internal successors, (206), 45 states have internal predecessors, (206), 0 states have call successors, (0), 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 14:46:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:21,145 INFO L93 Difference]: Finished difference Result 444 states and 479 transitions. [2021-11-22 14:46:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-22 14:46:21,145 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.5777777777777775) internal successors, (206), 45 states have internal predecessors, (206), 0 states have call successors, (0), 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 14:46:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:21,147 INFO L225 Difference]: With dead ends: 444 [2021-11-22 14:46:21,147 INFO L226 Difference]: Without dead ends: 345 [2021-11-22 14:46:21,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=973, Invalid=7032, Unknown=5, NotChecked=0, Total=8010 [2021-11-22 14:46:21,150 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 652 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 592 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:21,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [652 Valid, 2819 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1232 Invalid, 0 Unknown, 592 Unchecked, 1.1s Time] [2021-11-22 14:46:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-11-22 14:46:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 222. [2021-11-22 14:46:21,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 218 states have (on average 1.110091743119266) internal successors, (242), 221 states have internal predecessors, (242), 0 states have call successors, (0), 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 14:46:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 242 transitions. [2021-11-22 14:46:21,173 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 242 transitions. Word has length 74 [2021-11-22 14:46:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:21,173 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 242 transitions. [2021-11-22 14:46:21,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.5777777777777775) internal successors, (206), 45 states have internal predecessors, (206), 0 states have call successors, (0), 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 14:46:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 242 transitions. [2021-11-22 14:46:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-22 14:46:21,174 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:21,175 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] [2021-11-22 14:46:21,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-22 14:46:21,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-22 14:46:21,398 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:46:21,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash 144726291, now seen corresponding path program 1 times [2021-11-22 14:46:21,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:21,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999860718] [2021-11-22 14:46:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:21,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:22,199 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 14:46:22,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:22,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999860718] [2021-11-22 14:46:22,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999860718] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:22,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:22,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 14:46:22,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193214439] [2021-11-22 14:46:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:22,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 14:46:22,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:22,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 14:46:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-22 14:46:22,201 INFO L87 Difference]: Start difference. First operand 222 states and 242 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:46:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:23,643 INFO L93 Difference]: Finished difference Result 281 states and 305 transitions. [2021-11-22 14:46:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-22 14:46:23,644 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-22 14:46:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:23,645 INFO L225 Difference]: With dead ends: 281 [2021-11-22 14:46:23,645 INFO L226 Difference]: Without dead ends: 215 [2021-11-22 14:46:23,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=462, Invalid=1260, Unknown=0, NotChecked=0, Total=1722 [2021-11-22 14:46:23,647 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 771 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:23,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [771 Valid, 510 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 14:46:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-22 14:46:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 146. [2021-11-22 14:46:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.0833333333333333) internal successors, (156), 145 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 14:46:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2021-11-22 14:46:23,661 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 75 [2021-11-22 14:46:23,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:23,662 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2021-11-22 14:46:23,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:46:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2021-11-22 14:46:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 14:46:23,663 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:23,663 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 14:46:23,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-22 14:46:23,664 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:46:23,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1815229360, now seen corresponding path program 1 times [2021-11-22 14:46:23,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:23,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453414841] [2021-11-22 14:46:23,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:23,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:23,989 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 14:46:23,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:23,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453414841] [2021-11-22 14:46:23,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453414841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:23,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:23,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 14:46:23,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653414387] [2021-11-22 14:46:23,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:23,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 14:46:23,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:23,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 14:46:23,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:46:23,991 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 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 14:46:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:24,351 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2021-11-22 14:46:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 14:46:24,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 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 87 [2021-11-22 14:46:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:24,353 INFO L225 Difference]: With dead ends: 210 [2021-11-22 14:46:24,353 INFO L226 Difference]: Without dead ends: 197 [2021-11-22 14:46:24,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-11-22 14:46:24,354 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 295 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:24,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 276 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:46:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-22 14:46:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2021-11-22 14:46:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 193 states have (on average 1.072538860103627) internal successors, (207), 194 states have internal predecessors, (207), 0 states have call successors, (0), 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 14:46:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 207 transitions. [2021-11-22 14:46:24,376 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 207 transitions. Word has length 87 [2021-11-22 14:46:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:24,377 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 207 transitions. [2021-11-22 14:46:24,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 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 14:46:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 207 transitions. [2021-11-22 14:46:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 14:46:24,378 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:24,378 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 14:46:24,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 14:46:24,379 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:46:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1986260643, now seen corresponding path program 1 times [2021-11-22 14:46:24,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:24,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379478160] [2021-11-22 14:46:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:24,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:24,644 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 14:46:24,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:24,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379478160] [2021-11-22 14:46:24,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379478160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:24,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:24,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:46:24,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304029734] [2021-11-22 14:46:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:24,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 14:46:24,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 14:46:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:46:24,646 INFO L87 Difference]: Start difference. First operand 195 states and 207 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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 14:46:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:25,070 INFO L93 Difference]: Finished difference Result 288 states and 302 transitions. [2021-11-22 14:46:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 14:46:25,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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 14:46:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:25,072 INFO L225 Difference]: With dead ends: 288 [2021-11-22 14:46:25,072 INFO L226 Difference]: Without dead ends: 227 [2021-11-22 14:46:25,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-11-22 14:46:25,073 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 98 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:25,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 634 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 14:46:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-11-22 14:46:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 209. [2021-11-22 14:46:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 207 states have (on average 1.0628019323671498) internal successors, (220), 208 states have internal predecessors, (220), 0 states have call successors, (0), 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 14:46:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 220 transitions. [2021-11-22 14:46:25,093 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 220 transitions. Word has length 87 [2021-11-22 14:46:25,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:25,093 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 220 transitions. [2021-11-22 14:46:25,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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 14:46:25,094 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 220 transitions. [2021-11-22 14:46:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 14:46:25,094 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:25,095 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] [2021-11-22 14:46:25,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-22 14:46:25,095 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:46:25,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:25,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1999710515, now seen corresponding path program 1 times [2021-11-22 14:46:25,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:25,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719537362] [2021-11-22 14:46:25,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:25,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:25,400 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 14:46:25,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:25,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719537362] [2021-11-22 14:46:25,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719537362] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:25,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:25,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 14:46:25,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719043708] [2021-11-22 14:46:25,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:25,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:46:25,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:25,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:46:25,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:46:25,402 INFO L87 Difference]: Start difference. First operand 209 states and 220 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 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 14:46:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:25,824 INFO L93 Difference]: Finished difference Result 312 states and 325 transitions. [2021-11-22 14:46:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 14:46:25,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 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 90 [2021-11-22 14:46:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:25,827 INFO L225 Difference]: With dead ends: 312 [2021-11-22 14:46:25,827 INFO L226 Difference]: Without dead ends: 253 [2021-11-22 14:46:25,827 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 14:46:25,828 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 296 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:25,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 391 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 14:46:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-11-22 14:46:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 225. [2021-11-22 14:46:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 223 states have (on average 1.0582959641255605) internal successors, (236), 224 states have internal predecessors, (236), 0 states have call successors, (0), 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 14:46:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 236 transitions. [2021-11-22 14:46:25,852 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 236 transitions. Word has length 90 [2021-11-22 14:46:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:25,853 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 236 transitions. [2021-11-22 14:46:25,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 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 14:46:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 236 transitions. [2021-11-22 14:46:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-22 14:46:25,854 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:25,854 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] [2021-11-22 14:46:25,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-22 14:46:25,856 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:46:25,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 947590748, now seen corresponding path program 1 times [2021-11-22 14:46:25,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:25,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851553098] [2021-11-22 14:46:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:25,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:46:26,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:26,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851553098] [2021-11-22 14:46:26,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851553098] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:26,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:26,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 14:46:26,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616918246] [2021-11-22 14:46:26,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:26,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 14:46:26,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:26,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 14:46:26,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-22 14:46:26,298 INFO L87 Difference]: Start difference. First operand 225 states and 236 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:46:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:26,844 INFO L93 Difference]: Finished difference Result 355 states and 370 transitions. [2021-11-22 14:46:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 14:46:26,845 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-22 14:46:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:26,846 INFO L225 Difference]: With dead ends: 355 [2021-11-22 14:46:26,846 INFO L226 Difference]: Without dead ends: 282 [2021-11-22 14:46:26,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-11-22 14:46:26,848 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 257 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:26,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 739 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 14:46:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-22 14:46:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 225. [2021-11-22 14:46:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 223 states have (on average 1.053811659192825) internal successors, (235), 224 states have internal predecessors, (235), 0 states have call successors, (0), 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 14:46:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 235 transitions. [2021-11-22 14:46:26,874 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 235 transitions. Word has length 94 [2021-11-22 14:46:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:26,875 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 235 transitions. [2021-11-22 14:46:26,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:46:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 235 transitions. [2021-11-22 14:46:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-22 14:46:26,876 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:26,876 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] [2021-11-22 14:46:26,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 14:46:26,876 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:46:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1320750024, now seen corresponding path program 1 times [2021-11-22 14:46:26,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:26,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370298431] [2021-11-22 14:46:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:26,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:27,217 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 14:46:27,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:27,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370298431] [2021-11-22 14:46:27,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370298431] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:27,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:27,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 14:46:27,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112156105] [2021-11-22 14:46:27,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:27,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:46:27,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:27,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:46:27,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:46:27,220 INFO L87 Difference]: Start difference. First operand 225 states and 235 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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 14:46:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:27,433 INFO L93 Difference]: Finished difference Result 284 states and 296 transitions. [2021-11-22 14:46:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 14:46:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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 14:46:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:27,435 INFO L225 Difference]: With dead ends: 284 [2021-11-22 14:46:27,435 INFO L226 Difference]: Without dead ends: 225 [2021-11-22 14:46:27,436 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 14:46:27,436 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 95 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:27,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 237 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 14:46:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-22 14:46:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 209. [2021-11-22 14:46:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 207 states have (on average 1.0531400966183575) internal successors, (218), 208 states have internal predecessors, (218), 0 states have call successors, (0), 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 14:46:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 218 transitions. [2021-11-22 14:46:27,460 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 218 transitions. Word has length 95 [2021-11-22 14:46:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:27,461 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 218 transitions. [2021-11-22 14:46:27,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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 14:46:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 218 transitions. [2021-11-22 14:46:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-22 14:46:27,462 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:27,462 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] [2021-11-22 14:46:27,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-22 14:46:27,463 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:46:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash 428025628, now seen corresponding path program 1 times [2021-11-22 14:46:27,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:27,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216393425] [2021-11-22 14:46:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:27,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:27,802 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 14:46:27,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:27,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216393425] [2021-11-22 14:46:27,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216393425] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:27,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:27,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:46:27,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211944855] [2021-11-22 14:46:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:27,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 14:46:27,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 14:46:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:46:27,804 INFO L87 Difference]: Start difference. First operand 209 states and 218 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 14:46:28,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:28,107 INFO L93 Difference]: Finished difference Result 273 states and 281 transitions. [2021-11-22 14:46:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 14:46:28,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2021-11-22 14:46:28,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:28,109 INFO L225 Difference]: With dead ends: 273 [2021-11-22 14:46:28,109 INFO L226 Difference]: Without dead ends: 256 [2021-11-22 14:46:28,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-22 14:46:28,110 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 247 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:28,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 288 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 14:46:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-22 14:46:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 239. [2021-11-22 14:46:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 237 states have (on average 1.0464135021097047) internal successors, (248), 238 states have internal predecessors, (248), 0 states have call successors, (0), 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 14:46:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 248 transitions. [2021-11-22 14:46:28,134 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 248 transitions. Word has length 96 [2021-11-22 14:46:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:28,135 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 248 transitions. [2021-11-22 14:46:28,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 14:46:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 248 transitions. [2021-11-22 14:46:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 14:46:28,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:28,136 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] [2021-11-22 14:46:28,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-22 14:46:28,136 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 14:46:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash -616554032, now seen corresponding path program 1 times [2021-11-22 14:46:28,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:28,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125336942] [2021-11-22 14:46:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:28,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:33,361 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 14:46:33,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:33,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125336942] [2021-11-22 14:46:33,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125336942] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:46:33,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562241330] [2021-11-22 14:46:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:33,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:46:33,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:46:33,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:46:33,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af8bdb7-94fb-44da-8365-33e5be94b7fb/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 14:46:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:34,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 2715 conjuncts, 175 conjunts are in the unsatisfiable core [2021-11-22 14:46:34,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:46:34,820 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 14:46:35,125 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 14:46:35,125 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 14:46:35,387 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 14:46:35,398 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 25 treesize of output 13 [2021-11-22 14:46:35,404 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 24 treesize of output 20 [2021-11-22 14:46:35,970 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-11-22 14:46:35,970 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 20 treesize of output 22 [2021-11-22 14:46:36,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:46:36,203 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 48 treesize of output 24 [2021-11-22 14:46:36,232 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 14:46:36,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:46:36,256 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 32 treesize of output 16 [2021-11-22 14:46:36,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:46:36,685 INFO L354 Elim1Store]: treesize reduction 272, result has 16.3 percent of original size [2021-11-22 14:46:36,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 197 treesize of output 233 [2021-11-22 14:46:36,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:46:36,704 INFO L354 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2021-11-22 14:46:36,704 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 284 treesize of output 244 [2021-11-22 14:46:36,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:46:36,721 INFO L354 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2021-11-22 14:46:36,721 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 265 treesize of output 213 [2021-11-22 14:46:36,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:46:36,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:46:36,767 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 14:46:36,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 71 [2021-11-22 14:46:38,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:46:38,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:46:38,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:46:38,274 INFO L354 Elim1Store]: treesize reduction 260, result has 14.8 percent of original size [2021-11-22 14:46:38,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 222 treesize of output 210 [2021-11-22 14:46:38,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:46:38,281 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 208 treesize of output 190 [2021-11-22 14:46:38,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:46:38,330 INFO L354 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2021-11-22 14:46:38,330 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 193 treesize of output 192 [2021-11-22 14:46:38,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:46:38,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 14:46:38,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:46:38,341 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 14:46:38,341 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 184 treesize of output 151 [2021-11-22 14:46:38,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 14:46:38,357 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-22 14:46:38,357 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 169 treesize of output 132 [2021-11-22 14:46:49,400 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 14:46:49,401 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 153 treesize of output 125 [2021-11-22 14:46:49,408 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 14:46:49,409 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 119 treesize of output 107 [2021-11-22 14:46:49,780 INFO L354 Elim1Store]: treesize reduction 120, result has 7.0 percent of original size [2021-11-22 14:46:49,780 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 155 treesize of output 103 [2021-11-22 14:46:49,925 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 14:46:49,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:47:37,736 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| Int)) (let ((.cse118 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (or (let ((.cse117 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (let ((.cse119 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|)) (.cse120 (mod (select .cse117 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616))) (let ((.cse0 (<= .cse120 9223372036854775807)) (.cse1 (not (let ((.cse121 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store .cse117 .cse118 (select .cse119 (+ (- 18446744073709551616) .cse120 |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|)))))) (= (select (select .cse121 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0) (select (select .cse121 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))))) (.cse44 (< 9223372036854775807 .cse120)) (.cse45 (not (let ((.cse116 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store .cse117 .cse118 (select .cse119 (+ .cse120 |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|)))))) (= (select (select .cse116 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0) (select (select .cse116 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)))))) (and (or .cse0 .cse1 (forall ((v_DerPreprocessor_11 Int) (v_prenex_4 Int) (v_prenex_3 Int) (v_DerPreprocessor_9 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse13 (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 .cse7 (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|))))))) (let ((.cse12 (store (let ((.cse14 (select .cse13 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse14 0 (+ (- 1) (select .cse14 0)))) 8 v_DerPreprocessor_9))) (let ((.cse4 (store .cse13 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse12))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse11 (mod (select .cse3 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (let ((.cse2 (* (let ((.cse8 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse7 v_DerPreprocessor_12)))) (store .cse5 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_4))) (store .cse6 8 (select .cse6 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse8)) (+ (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse7 v_DerPreprocessor_11)))) (store .cse9 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse10 (store (select .cse9 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_3))) (store .cse10 8 (+ (select .cse10 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse8) .cse11))) (- 1)))) (<= (div (+ .cse2 (- 1)) (- 256)) (div (+ .cse2 (- 1) (mod (select .cse3 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)))) (< 9223372036854775807 .cse11) (<= (mod (select (select .cse4 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse12 0) 18446744073709551616))))))))))) (or .cse0 .cse1 (forall ((v_DerPreprocessor_11 Int) (v_prenex_2 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int)) (let ((.cse22 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse29 .cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse29 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse26 (store (let ((.cse28 (select .cse27 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse28 0 (+ (- 1) (select .cse28 0)))) 8 v_DerPreprocessor_9))) (let ((.cse19 (store .cse27 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse26))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse16 (mod (select .cse18 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= .cse16 9223372036854775807) (let ((.cse17 (* (let ((.cse23 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse19 (select (select (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse22 v_DerPreprocessor_12)))) (store .cse20 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse21 (store (select .cse20 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_2))) (store .cse21 8 (select .cse21 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse23)) (+ (- 18446744073709551616) (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse22 v_DerPreprocessor_11)))) (store .cse24 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse25 (store (select .cse24 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_1))) (store .cse25 8 (+ (select .cse25 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse23) .cse16))) (- 1)))) (<= (div (+ (- 1) .cse17) (- 256)) (div (+ (- 1) (mod (select .cse18 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) .cse17) (- 256)))) (<= (mod (select (select .cse19 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse26 0) 18446744073709551616))))))))))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_4 Int) (v_prenex_3 Int) (v_DerPreprocessor_9 Int)) (let ((.cse37 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse43 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse43 .cse37 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse43 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse30 (store (let ((.cse42 (select .cse41 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse42 0 (+ (- 1) (select .cse42 0)))) 8 v_DerPreprocessor_9))) (let ((.cse34 (store .cse41 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse30))) (let ((.cse33 (select .cse34 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse31 (mod (select .cse33 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (< 0 (mod (select .cse30 0) 18446744073709551616)) (< 9223372036854775807 .cse31) (let ((.cse32 (* (let ((.cse38 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse34 (select (select (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse37 v_DerPreprocessor_12)))) (store .cse35 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse36 (store (select .cse35 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_4))) (store .cse36 8 (select .cse36 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse38)) (+ (select (select (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse37 v_DerPreprocessor_11)))) (store .cse39 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse40 (store (select .cse39 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_3))) (store .cse40 8 (+ (select .cse40 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse38) .cse31))) (- 1)))) (<= (div (+ (- 1) .cse32) (- 256)) (div (+ (- 1) (mod (select .cse33 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) .cse32) (- 256)))) (<= (mod (select (select .cse34 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0))))))))) .cse44 .cse45) (or .cse0 (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_10 Int)) (let ((.cse52 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse59 .cse52 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse59 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse56 (store (let ((.cse58 (select .cse57 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse58 0 (+ (- 1) (select .cse58 0)))) 8 v_DerPreprocessor_9))) (let ((.cse49 (store .cse57 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse56))) (let ((.cse47 (select .cse49 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse46 (mod (select .cse47 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= .cse46 9223372036854775807) (let ((.cse48 (let ((.cse53 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse49 (select (select (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse52 v_DerPreprocessor_12)))) (store .cse50 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse51 (store (select .cse50 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_10))) (store .cse51 8 (select .cse51 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse53)) (+ (- 18446744073709551616) (select (select (let ((.cse54 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse52 v_DerPreprocessor_11)))) (store .cse54 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse55 (store (select .cse54 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_8))) (store .cse55 8 (+ (select .cse55 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse53) .cse46))))) (<= (div (+ (mod (select .cse47 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) (* .cse48 (- 1))) (- 256)) (+ (div (+ (- 256) .cse48) 256) 1))) (<= (mod (select (select .cse49 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse56 0) 18446744073709551616)))))))))) .cse1) (or .cse0 (forall ((v_prenex_6 Int) (v_DerPreprocessor_11 Int) (v_prenex_5 Int) (v_DerPreprocessor_9 Int)) (let ((.cse67 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse73 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse73 .cse67 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse73 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse62 (store (let ((.cse72 (select .cse71 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse72 0 (+ (- 1) (select .cse72 0)))) 8 v_DerPreprocessor_9))) (let ((.cse61 (store .cse71 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse62))) (let ((.cse64 (select .cse61 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse60 (mod (select .cse64 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (< 9223372036854775807 .cse60) (<= (mod (select (select .cse61 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse62 0) 18446744073709551616)) (let ((.cse63 (let ((.cse68 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse61 (select (select (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse67 v_DerPreprocessor_12)))) (store .cse65 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse66 (store (select .cse65 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_6))) (store .cse66 8 (select .cse66 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse68)) (+ (select (select (let ((.cse69 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse67 v_DerPreprocessor_11)))) (store .cse69 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse70 (store (select .cse69 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_5))) (store .cse70 8 (+ (select .cse70 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse68) .cse60))))) (<= (div (+ (* .cse63 (- 1)) (mod (select .cse64 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)) (+ 1 (div (+ .cse63 (- 256)) 256)))))))))))) .cse1) (or .cse44 (forall ((v_DerPreprocessor_11 Int) (v_prenex_2 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int)) (let ((.cse81 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse87 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse87 .cse81 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse87 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse75 (store (let ((.cse86 (select .cse85 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse86 0 (+ (- 1) (select .cse86 0)))) 8 v_DerPreprocessor_9))) (let ((.cse76 (store .cse85 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse75))) (let ((.cse78 (select .cse76 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse74 (mod (select .cse78 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= .cse74 9223372036854775807) (< 0 (mod (select .cse75 0) 18446744073709551616)) (<= (mod (select (select .cse76 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (let ((.cse77 (* (let ((.cse82 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse76 (select (select (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse81 v_DerPreprocessor_12)))) (store .cse79 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse80 (store (select .cse79 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_2))) (store .cse80 8 (select .cse80 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse82)) (+ (- 18446744073709551616) .cse74 (select (select (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse81 v_DerPreprocessor_11)))) (store .cse83 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse84 (store (select .cse83 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_1))) (store .cse84 8 (+ (select .cse84 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse82)))) (- 1)))) (<= (div (+ (- 1) .cse77) (- 256)) (div (+ (- 1) .cse77 (mod (select .cse78 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)))))))))))) .cse45) (or .cse44 .cse45 (forall ((v_prenex_6 Int) (v_DerPreprocessor_11 Int) (v_prenex_5 Int) (v_DerPreprocessor_9 Int)) (let ((.cse95 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse101 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse101 .cse95 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse101 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse88 (store (let ((.cse100 (select .cse99 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse100 0 (+ (- 1) (select .cse100 0)))) 8 v_DerPreprocessor_9))) (let ((.cse90 (store .cse99 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse88))) (let ((.cse92 (select .cse90 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse89 (mod (select .cse92 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (< 0 (mod (select .cse88 0) 18446744073709551616)) (< 9223372036854775807 .cse89) (<= (mod (select (select .cse90 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (let ((.cse91 (let ((.cse96 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse90 (select (select (let ((.cse93 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse95 v_DerPreprocessor_12)))) (store .cse93 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse94 (store (select .cse93 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_6))) (store .cse94 8 (select .cse94 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse96)) (+ (select (select (let ((.cse97 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse95 v_DerPreprocessor_11)))) (store .cse97 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse98 (store (select .cse97 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_5))) (store .cse98 8 (+ (select .cse98 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse96) .cse89))))) (<= (div (+ (* .cse91 (- 1)) (mod (select .cse92 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)) (+ (div (+ (- 256) .cse91) 256) 1)))))))))))) (or .cse44 (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_10 Int)) (let ((.cse109 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse115 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse115 .cse109 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse115 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse103 (store (let ((.cse114 (select .cse113 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse114 0 (+ (- 1) (select .cse114 0)))) 8 v_DerPreprocessor_9))) (let ((.cse106 (store .cse113 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse103))) (let ((.cse105 (select .cse106 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse102 (mod (select .cse105 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= .cse102 9223372036854775807) (< 0 (mod (select .cse103 0) 18446744073709551616)) (let ((.cse104 (let ((.cse110 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse106 (select (select (let ((.cse107 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse109 v_DerPreprocessor_12)))) (store .cse107 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse108 (store (select .cse107 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_10))) (store .cse108 8 (select .cse108 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse110)) (+ (- 18446744073709551616) .cse102 (select (select (let ((.cse111 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse109 v_DerPreprocessor_11)))) (store .cse111 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse112 (store (select .cse111 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_8))) (store .cse112 8 (+ (select .cse112 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse110)))))) (<= (div (+ (* .cse104 (- 1)) (mod (select .cse105 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)) (+ (div (+ .cse104 (- 256)) 256) 1))) (<= (mod (select (select .cse106 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0))))))))) .cse45))))) (not (let ((.cse122 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse118 v_DerPreprocessor_12)))) (= (select (select .cse122 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 8) (select (select .cse122 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))))) (<= |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| |c_#StackHeapBarrier|)))) is different from true [2021-11-22 14:47:48,109 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| Int)) (let ((.cse118 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (or (let ((.cse117 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (let ((.cse119 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|)) (.cse120 (mod (select .cse117 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616))) (let ((.cse0 (<= .cse120 9223372036854775807)) (.cse1 (not (let ((.cse121 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store .cse117 .cse118 (select .cse119 (+ (- 18446744073709551616) .cse120 |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|)))))) (= (select (select .cse121 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0) (select (select .cse121 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))))) (.cse44 (< 9223372036854775807 .cse120)) (.cse45 (not (let ((.cse116 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store .cse117 .cse118 (select .cse119 (+ .cse120 |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|)))))) (= (select (select .cse116 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0) (select (select .cse116 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|)))))) (and (or .cse0 .cse1 (forall ((v_DerPreprocessor_11 Int) (v_prenex_4 Int) (v_prenex_3 Int) (v_DerPreprocessor_9 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse13 (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 .cse7 (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|))))))) (let ((.cse12 (store (let ((.cse14 (select .cse13 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse14 0 (+ (- 1) (select .cse14 0)))) 8 v_DerPreprocessor_9))) (let ((.cse4 (store .cse13 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse12))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse11 (mod (select .cse3 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (let ((.cse2 (* (let ((.cse8 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse7 v_DerPreprocessor_12)))) (store .cse5 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse6 (store (select .cse5 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_4))) (store .cse6 8 (select .cse6 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse8)) (+ (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse7 v_DerPreprocessor_11)))) (store .cse9 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse10 (store (select .cse9 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_3))) (store .cse10 8 (+ (select .cse10 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse8) .cse11))) (- 1)))) (<= (div (+ .cse2 (- 1)) (- 256)) (div (+ .cse2 (- 1) (mod (select .cse3 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)))) (< 9223372036854775807 .cse11) (<= (mod (select (select .cse4 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse12 0) 18446744073709551616))))))))))) (or .cse0 .cse1 (forall ((v_DerPreprocessor_11 Int) (v_prenex_2 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int)) (let ((.cse22 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse29 .cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse29 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse26 (store (let ((.cse28 (select .cse27 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse28 0 (+ (- 1) (select .cse28 0)))) 8 v_DerPreprocessor_9))) (let ((.cse19 (store .cse27 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse26))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse16 (mod (select .cse18 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= .cse16 9223372036854775807) (let ((.cse17 (* (let ((.cse23 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse19 (select (select (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse22 v_DerPreprocessor_12)))) (store .cse20 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse21 (store (select .cse20 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_2))) (store .cse21 8 (select .cse21 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse23)) (+ (- 18446744073709551616) (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse22 v_DerPreprocessor_11)))) (store .cse24 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse25 (store (select .cse24 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_1))) (store .cse25 8 (+ (select .cse25 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse23) .cse16))) (- 1)))) (<= (div (+ (- 1) .cse17) (- 256)) (div (+ (- 1) (mod (select .cse18 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) .cse17) (- 256)))) (<= (mod (select (select .cse19 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse26 0) 18446744073709551616))))))))))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_4 Int) (v_prenex_3 Int) (v_DerPreprocessor_9 Int)) (let ((.cse37 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse43 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse43 .cse37 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse43 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse30 (store (let ((.cse42 (select .cse41 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse42 0 (+ (- 1) (select .cse42 0)))) 8 v_DerPreprocessor_9))) (let ((.cse34 (store .cse41 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse30))) (let ((.cse33 (select .cse34 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse31 (mod (select .cse33 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (< 0 (mod (select .cse30 0) 18446744073709551616)) (< 9223372036854775807 .cse31) (let ((.cse32 (* (let ((.cse38 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse34 (select (select (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse37 v_DerPreprocessor_12)))) (store .cse35 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse36 (store (select .cse35 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_4))) (store .cse36 8 (select .cse36 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse38)) (+ (select (select (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse37 v_DerPreprocessor_11)))) (store .cse39 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse40 (store (select .cse39 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_3))) (store .cse40 8 (+ (select .cse40 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse38) .cse31))) (- 1)))) (<= (div (+ (- 1) .cse32) (- 256)) (div (+ (- 1) (mod (select .cse33 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) .cse32) (- 256)))) (<= (mod (select (select .cse34 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0))))))))) .cse44 .cse45) (or .cse0 (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_10 Int)) (let ((.cse52 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse59 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse59 .cse52 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse59 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse56 (store (let ((.cse58 (select .cse57 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse58 0 (+ (- 1) (select .cse58 0)))) 8 v_DerPreprocessor_9))) (let ((.cse49 (store .cse57 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse56))) (let ((.cse47 (select .cse49 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse46 (mod (select .cse47 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= .cse46 9223372036854775807) (let ((.cse48 (let ((.cse53 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse49 (select (select (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse52 v_DerPreprocessor_12)))) (store .cse50 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse51 (store (select .cse50 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_10))) (store .cse51 8 (select .cse51 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse53)) (+ (- 18446744073709551616) (select (select (let ((.cse54 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse52 v_DerPreprocessor_11)))) (store .cse54 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse55 (store (select .cse54 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_8))) (store .cse55 8 (+ (select .cse55 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse53) .cse46))))) (<= (div (+ (mod (select .cse47 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) (* .cse48 (- 1))) (- 256)) (+ (div (+ (- 256) .cse48) 256) 1))) (<= (mod (select (select .cse49 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse56 0) 18446744073709551616)))))))))) .cse1) (or .cse0 (forall ((v_prenex_6 Int) (v_DerPreprocessor_11 Int) (v_prenex_5 Int) (v_DerPreprocessor_9 Int)) (let ((.cse67 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse73 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse73 .cse67 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (- 18446744073709551616) (mod (select .cse73 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse62 (store (let ((.cse72 (select .cse71 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse72 0 (+ (- 1) (select .cse72 0)))) 8 v_DerPreprocessor_9))) (let ((.cse61 (store .cse71 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse62))) (let ((.cse64 (select .cse61 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse60 (mod (select .cse64 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (< 9223372036854775807 .cse60) (<= (mod (select (select .cse61 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse62 0) 18446744073709551616)) (let ((.cse63 (let ((.cse68 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse61 (select (select (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse67 v_DerPreprocessor_12)))) (store .cse65 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse66 (store (select .cse65 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_6))) (store .cse66 8 (select .cse66 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse68)) (+ (select (select (let ((.cse69 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse67 v_DerPreprocessor_11)))) (store .cse69 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse70 (store (select .cse69 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_5))) (store .cse70 8 (+ (select .cse70 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse68) .cse60))))) (<= (div (+ (* .cse63 (- 1)) (mod (select .cse64 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)) (+ 1 (div (+ .cse63 (- 256)) 256)))))))))))) .cse1) (or .cse44 (forall ((v_DerPreprocessor_11 Int) (v_prenex_2 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int)) (let ((.cse81 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse87 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse87 .cse81 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse87 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse75 (store (let ((.cse86 (select .cse85 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse86 0 (+ (- 1) (select .cse86 0)))) 8 v_DerPreprocessor_9))) (let ((.cse76 (store .cse85 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse75))) (let ((.cse78 (select .cse76 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse74 (mod (select .cse78 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= .cse74 9223372036854775807) (< 0 (mod (select .cse75 0) 18446744073709551616)) (<= (mod (select (select .cse76 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (let ((.cse77 (* (let ((.cse82 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse76 (select (select (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse81 v_DerPreprocessor_12)))) (store .cse79 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse80 (store (select .cse79 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_2))) (store .cse80 8 (select .cse80 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse82)) (+ (- 18446744073709551616) .cse74 (select (select (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse81 v_DerPreprocessor_11)))) (store .cse83 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse84 (store (select .cse83 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_1))) (store .cse84 8 (+ (select .cse84 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse82)))) (- 1)))) (<= (div (+ (- 1) .cse77) (- 256)) (div (+ (- 1) .cse77 (mod (select .cse78 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)))))))))))) .cse45) (or .cse44 .cse45 (forall ((v_prenex_6 Int) (v_DerPreprocessor_11 Int) (v_prenex_5 Int) (v_DerPreprocessor_9 Int)) (let ((.cse95 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse101 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse101 .cse95 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse101 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse88 (store (let ((.cse100 (select .cse99 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse100 0 (+ (- 1) (select .cse100 0)))) 8 v_DerPreprocessor_9))) (let ((.cse90 (store .cse99 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse88))) (let ((.cse92 (select .cse90 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse89 (mod (select .cse92 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (< 0 (mod (select .cse88 0) 18446744073709551616)) (< 9223372036854775807 .cse89) (<= (mod (select (select .cse90 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (let ((.cse91 (let ((.cse96 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse90 (select (select (let ((.cse93 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse95 v_DerPreprocessor_12)))) (store .cse93 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse94 (store (select .cse93 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_6))) (store .cse94 8 (select .cse94 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse96)) (+ (select (select (let ((.cse97 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse95 v_DerPreprocessor_11)))) (store .cse97 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse98 (store (select .cse97 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_5))) (store .cse98 8 (+ (select .cse98 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse96) .cse89))))) (<= (div (+ (* .cse91 (- 1)) (mod (select .cse92 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)) (+ (div (+ (- 256) .cse91) 256) 1)))))))))))) (or .cse44 (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_10 Int)) (let ((.cse109 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse115 (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (store .cse115 .cse109 (select (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod (select .cse115 |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse103 (store (let ((.cse114 (select .cse113 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (store .cse114 0 (+ (- 1) (select .cse114 0)))) 8 v_DerPreprocessor_9))) (let ((.cse106 (store .cse113 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse103))) (let ((.cse105 (select .cse106 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse102 (mod (select .cse105 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= .cse102 9223372036854775807) (< 0 (mod (select .cse103 0) 18446744073709551616)) (let ((.cse104 (let ((.cse110 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse106 (select (select (let ((.cse107 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse109 v_DerPreprocessor_12)))) (store .cse107 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse108 (store (select .cse107 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_10))) (store .cse108 8 (select .cse108 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse110)) (+ (- 18446744073709551616) .cse102 (select (select (let ((.cse111 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse109 v_DerPreprocessor_11)))) (store .cse111 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse112 (store (select .cse111 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_8))) (store .cse112 8 (+ (select .cse112 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse110)))))) (<= (div (+ (* .cse104 (- 1)) (mod (select .cse105 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)) (+ (div (+ .cse104 (- 256)) 256) 1))) (<= (mod (select (select .cse106 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0))))))))) .cse45))))) (not (let ((.cse122 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) .cse118 v_DerPreprocessor_12)))) (= (select (select .cse122 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 8) (select (select .cse122 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))))) (<= |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| |c_#StackHeapBarrier|)))) (= (mod |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 256) 0)) is different from true [2021-11-22 14:50:22,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| Int)) (or (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) v_DerPreprocessor_12)))) (= (select (select .cse0 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 8) (select (select .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))))) (<= |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| |c_#StackHeapBarrier|) (and (forall ((v_DerPreprocessor_13 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_18 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse11 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse16 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse16 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse16) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) (- 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse15 (select .cse4 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse5 (select .cse15 0))) (let ((.cse6 (store (store .cse15 0 (+ (- 1) .cse5)) 8 v_prenex_21))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse6))) (let ((.cse8 (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse1 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse3 (mod (select .cse8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse1) (<= (mod (select (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< .cse1 0) (< 9223372036854775807 .cse3) (not (= (select (select .cse4 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse5)) (< 0 (mod (select .cse6 0) 18446744073709551616)) (<= 18446744073709551616 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (let ((.cse7 (* (let ((.cse12 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse2 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse11 v_DerPreprocessor_12)))) (store .cse9 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse10 (store (select .cse9 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_19))) (store .cse10 8 (select .cse10 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse12)) (+ .cse3 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse11 v_prenex_18)))) (store .cse13 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse14 (store (select .cse13 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_20))) (store .cse14 8 (+ (select .cse14 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse12)))) (- 1)))) (<= (div (+ (- 1) .cse7) (- 256)) (div (+ (- 1) (mod (select .cse8 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) .cse7) (- 256)))) (<= |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 9223372036854775807))))))))))) (forall ((v_DerPreprocessor_13 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_10 Int)) (let ((.cse25 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse32 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse32 .cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse32) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse31 (select .cse18 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse19 (select .cse31 0))) (let ((.cse30 (store (store .cse31 0 (+ (- 1) .cse19)) 8 v_DerPreprocessor_9))) (let ((.cse20 (store .cse18 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse30))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse17 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse29 (mod (select .cse21 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse17) (< .cse17 0) (not (= (select (select .cse18 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse19)) (< 9223372036854775807 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (<= (mod (select (select .cse20 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (let ((.cse22 (let ((.cse26 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse20 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse25 v_DerPreprocessor_12)))) (store .cse23 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse24 (store (select .cse23 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_10))) (store .cse24 8 (select .cse24 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse26)) (+ (- 18446744073709551616) (select (select (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse25 v_DerPreprocessor_11)))) (store .cse27 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse28 (store (select .cse27 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_8))) (store .cse28 8 (+ 1 (select .cse28 8)))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse26) .cse29))))) (<= (div (+ (mod (select .cse21 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) (* .cse22 (- 1))) (- 256)) (+ (div (+ (- 256) .cse22) 256) 1))) (< |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 0) (<= .cse29 9223372036854775807) (< 0 (mod (select .cse30 0) 18446744073709551616)))))))))))) (forall ((v_DerPreprocessor_13 Int) (v_prenex_6 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_5 Int) (v_prenex_12 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_prenex_13 Int)) (let ((.cse43 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse48 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse48 .cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse48) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) (- 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse47 (select .cse36 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse37 (select .cse47 0))) (let ((.cse35 (store (store .cse47 0 (+ (- 1) .cse37)) 8 v_prenex_13))) (let ((.cse34 (store .cse36 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse35))) (let ((.cse40 (select .cse34 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse33 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse38 (mod (select .cse40 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse33) (<= (mod (select (select .cse34 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse35 0) 18446744073709551616)) (< .cse33 0) (not (= (select (select .cse36 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse37)) (< 9223372036854775807 .cse38) (let ((.cse39 (let ((.cse44 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse34 (select (select (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse43 v_DerPreprocessor_12)))) (store .cse41 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse42 (store (select .cse41 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_6))) (store .cse42 8 (select .cse42 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse44)) (+ .cse38 (select (select (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse43 v_prenex_12)))) (store .cse45 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse46 (store (select .cse45 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_5))) (store .cse46 8 (+ 1 (select .cse46 8)))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse44)))))) (<= (div (+ (* .cse39 (- 1)) (mod (select .cse40 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)) (+ (div (+ (- 256) .cse39) 256) 1))) (<= 18446744073709551616 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (<= |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 9223372036854775807))))))))))) (forall ((v_DerPreprocessor_13 Int) (v_prenex_15 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_4 Int) (v_prenex_3 Int) (v_prenex_14 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int)) (let ((.cse58 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse64 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse64 .cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse64) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse63 (select .cse52 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse53 (select .cse63 0))) (let ((.cse50 (store (store .cse63 0 (+ (- 1) .cse53)) 8 v_prenex_15))) (let ((.cse51 (store .cse52 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse50))) (let ((.cse55 (select .cse51 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse49 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse62 (mod (select .cse55 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse49) (< 0 (mod (select .cse50 0) 18446744073709551616)) (<= (mod (select (select .cse51 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< .cse49 0) (not (= (select (select .cse52 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse53)) (let ((.cse54 (* (let ((.cse59 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse51 (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse58 v_DerPreprocessor_12)))) (store .cse56 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse57 (store (select .cse56 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_4))) (store .cse57 8 (select .cse57 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse59)) (+ (select (select (let ((.cse60 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse58 v_prenex_14)))) (store .cse60 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse61 (store (select .cse60 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_3))) (store .cse61 8 (+ (select .cse61 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse59) .cse62))) (- 1)))) (<= (div (+ (- 1) .cse54) (- 256)) (div (+ (- 1) .cse54 (mod (select .cse55 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)))) (< 9223372036854775807 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (< |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 0) (< 9223372036854775807 .cse62))))))))))) (forall ((v_DerPreprocessor_13 Int) (v_prenex_16 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_17 Int) (v_prenex_2 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_prenex_1 Int)) (let ((.cse71 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse80 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse80 .cse71 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse80) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) (- 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse79 (select .cse76 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse77 (select .cse79 0))) (let ((.cse78 (store (store .cse79 0 (+ (- 1) .cse77)) 8 v_prenex_17))) (let ((.cse68 (store .cse76 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse78))) (let ((.cse67 (select .cse68 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse65 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse75 (mod (select .cse67 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse65) (< .cse65 0) (let ((.cse66 (* (let ((.cse72 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse68 (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse71 v_DerPreprocessor_12)))) (store .cse69 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse70 (store (select .cse69 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_2))) (store .cse70 8 (select .cse70 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse72)) (+ (- 18446744073709551616) (select (select (let ((.cse73 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse71 v_prenex_16)))) (store .cse73 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse74 (store (select .cse73 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_1))) (store .cse74 8 (+ (select .cse74 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse72) .cse75))) (- 1)))) (<= (div (+ (- 1) .cse66) (- 256)) (div (+ (- 1) .cse66 (mod (select .cse67 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)))) (not (= (select (select .cse76 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse77)) (<= 18446744073709551616 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (<= .cse75 9223372036854775807) (<= (mod (select (select .cse68 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse78 0) 18446744073709551616)) (<= |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 9223372036854775807))))))))))) (forall ((v_DerPreprocessor_13 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_prenex_24 Int)) (let ((.cse91 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse96 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse96 .cse91 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse96) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse95 (select .cse84 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse85 (select .cse95 0))) (let ((.cse82 (store (store .cse95 0 (+ (- 1) .cse85)) 8 v_prenex_24))) (let ((.cse88 (store .cse84 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse82))) (let ((.cse87 (select .cse88 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse81 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse83 (mod (select .cse87 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse81) (< 0 (mod (select .cse82 0) 18446744073709551616)) (<= .cse83 9223372036854775807) (< .cse81 0) (not (= (select (select .cse84 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse85)) (< 9223372036854775807 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (let ((.cse86 (* (let ((.cse92 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse88 (select (select (let ((.cse89 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse91 v_DerPreprocessor_12)))) (store .cse89 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse90 (store (select .cse89 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_23))) (store .cse90 8 (select .cse90 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse92)) (+ (- 18446744073709551616) (select (select (let ((.cse93 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse91 v_prenex_22)))) (store .cse93 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse94 (store (select .cse93 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_25))) (store .cse94 8 (+ (select .cse94 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse92) .cse83))) (- 1)))) (<= (div (+ (- 1) .cse86) (- 256)) (div (+ (- 1) (mod (select .cse87 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) .cse86) (- 256)))) (< |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 0) (<= (mod (select (select .cse88 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0))))))))))) (forall ((v_DerPreprocessor_13 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_33 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse105 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse109 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse112 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse112 .cse105 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse112) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) (- 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse111 (select .cse109 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse110 (select .cse111 0))) (let ((.cse98 (store (store .cse111 0 (+ (- 1) .cse110)) 8 v_prenex_31))) (let ((.cse102 (store .cse109 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse98))) (let ((.cse100 (select .cse102 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse97 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse99 (mod (select .cse100 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse97) (< 0 (mod (select .cse98 0) 18446744073709551616)) (<= .cse99 9223372036854775807) (< .cse97 0) (let ((.cse101 (let ((.cse106 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse102 (select (select (let ((.cse103 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse105 v_DerPreprocessor_12)))) (store .cse103 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse104 (store (select .cse103 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_33))) (store .cse104 8 (select .cse104 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse106)) (+ (- 18446744073709551616) .cse99 (select (select (let ((.cse107 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse105 v_prenex_30)))) (store .cse107 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse108 (store (select .cse107 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_32))) (store .cse108 8 (+ (select .cse108 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse106)))))) (<= (div (+ (mod (select .cse100 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) (* .cse101 (- 1))) (- 256)) (+ (div (+ (- 256) .cse101) 256) 1))) (not (= (select (select .cse109 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse110)) (<= 18446744073709551616 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (<= (mod (select (select .cse102 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (<= |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 9223372036854775807))))))))))) (forall ((v_DerPreprocessor_13 Int) (v_prenex_27 Int) (v_prenex_26 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int)) (let ((.cse123 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse116 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse128 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse128 .cse123 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse128) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse127 (select .cse116 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse117 (select .cse127 0))) (let ((.cse114 (store (store .cse127 0 (+ (- 1) .cse117)) 8 v_prenex_29))) (let ((.cse120 (store .cse116 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse114))) (let ((.cse118 (select .cse120 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse113 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse115 (mod (select .cse118 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse113) (< 0 (mod (select .cse114 0) 18446744073709551616)) (< 9223372036854775807 .cse115) (< .cse113 0) (not (= (select (select .cse116 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse117)) (< 9223372036854775807 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (let ((.cse119 (let ((.cse124 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse120 (select (select (let ((.cse121 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse123 v_DerPreprocessor_12)))) (store .cse121 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse122 (store (select .cse121 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_26))) (store .cse122 8 (select .cse122 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse124)) (+ .cse115 (select (select (let ((.cse125 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse123 v_prenex_27)))) (store .cse125 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse126 (store (select .cse125 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_28))) (store .cse126 8 (+ (select .cse126 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse124)))))) (<= (div (+ (mod (select .cse118 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) (* .cse119 (- 1))) (- 256)) (+ (div (+ .cse119 (- 256)) 256) 1))) (< |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 0) (<= (mod (select (select .cse120 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0)))))))))))))) is different from false [2021-11-22 14:50:24,433 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| Int)) (or (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8) v_DerPreprocessor_12)))) (= (select (select .cse0 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 8) (select (select .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))))) (<= |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| |c_#StackHeapBarrier|) (and (forall ((v_DerPreprocessor_13 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_18 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse11 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse16 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse16 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse16) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) (- 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse15 (select .cse4 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse5 (select .cse15 0))) (let ((.cse6 (store (store .cse15 0 (+ (- 1) .cse5)) 8 v_prenex_21))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse6))) (let ((.cse8 (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse1 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse3 (mod (select .cse8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse1) (<= (mod (select (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< .cse1 0) (< 9223372036854775807 .cse3) (not (= (select (select .cse4 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse5)) (< 0 (mod (select .cse6 0) 18446744073709551616)) (<= 18446744073709551616 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (let ((.cse7 (* (let ((.cse12 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse2 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse11 v_DerPreprocessor_12)))) (store .cse9 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse10 (store (select .cse9 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_19))) (store .cse10 8 (select .cse10 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse12)) (+ .cse3 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse11 v_prenex_18)))) (store .cse13 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse14 (store (select .cse13 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_20))) (store .cse14 8 (+ (select .cse14 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse12)))) (- 1)))) (<= (div (+ (- 1) .cse7) (- 256)) (div (+ (- 1) (mod (select .cse8 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) .cse7) (- 256)))) (<= |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 9223372036854775807))))))))))) (forall ((v_DerPreprocessor_13 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_10 Int)) (let ((.cse25 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse32 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse32 .cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse32) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse31 (select .cse18 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse19 (select .cse31 0))) (let ((.cse30 (store (store .cse31 0 (+ (- 1) .cse19)) 8 v_DerPreprocessor_9))) (let ((.cse20 (store .cse18 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse30))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse17 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse29 (mod (select .cse21 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse17) (< .cse17 0) (not (= (select (select .cse18 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse19)) (< 9223372036854775807 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (<= (mod (select (select .cse20 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (let ((.cse22 (let ((.cse26 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse20 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse25 v_DerPreprocessor_12)))) (store .cse23 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse24 (store (select .cse23 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_10))) (store .cse24 8 (select .cse24 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse26)) (+ (- 18446744073709551616) (select (select (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse25 v_DerPreprocessor_11)))) (store .cse27 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse28 (store (select .cse27 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_DerPreprocessor_8))) (store .cse28 8 (+ 1 (select .cse28 8)))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse26) .cse29))))) (<= (div (+ (mod (select .cse21 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) (* .cse22 (- 1))) (- 256)) (+ (div (+ (- 256) .cse22) 256) 1))) (< |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 0) (<= .cse29 9223372036854775807) (< 0 (mod (select .cse30 0) 18446744073709551616)))))))))))) (forall ((v_DerPreprocessor_13 Int) (v_prenex_6 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_5 Int) (v_prenex_12 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_prenex_13 Int)) (let ((.cse43 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse48 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse48 .cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse48) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) (- 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse47 (select .cse36 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse37 (select .cse47 0))) (let ((.cse35 (store (store .cse47 0 (+ (- 1) .cse37)) 8 v_prenex_13))) (let ((.cse34 (store .cse36 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse35))) (let ((.cse40 (select .cse34 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse33 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse38 (mod (select .cse40 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse33) (<= (mod (select (select .cse34 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse35 0) 18446744073709551616)) (< .cse33 0) (not (= (select (select .cse36 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse37)) (< 9223372036854775807 .cse38) (let ((.cse39 (let ((.cse44 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse34 (select (select (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse43 v_DerPreprocessor_12)))) (store .cse41 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse42 (store (select .cse41 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_6))) (store .cse42 8 (select .cse42 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse44)) (+ .cse38 (select (select (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse43 v_prenex_12)))) (store .cse45 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse46 (store (select .cse45 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_5))) (store .cse46 8 (+ 1 (select .cse46 8)))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse44)))))) (<= (div (+ (* .cse39 (- 1)) (mod (select .cse40 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)) (+ (div (+ (- 256) .cse39) 256) 1))) (<= 18446744073709551616 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (<= |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 9223372036854775807))))))))))) (forall ((v_DerPreprocessor_13 Int) (v_prenex_15 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_4 Int) (v_prenex_3 Int) (v_prenex_14 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int)) (let ((.cse58 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse64 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse64 .cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse64) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse63 (select .cse52 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse53 (select .cse63 0))) (let ((.cse50 (store (store .cse63 0 (+ (- 1) .cse53)) 8 v_prenex_15))) (let ((.cse51 (store .cse52 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse50))) (let ((.cse55 (select .cse51 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse49 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse62 (mod (select .cse55 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse49) (< 0 (mod (select .cse50 0) 18446744073709551616)) (<= (mod (select (select .cse51 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< .cse49 0) (not (= (select (select .cse52 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse53)) (let ((.cse54 (* (let ((.cse59 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse51 (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse58 v_DerPreprocessor_12)))) (store .cse56 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse57 (store (select .cse56 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_4))) (store .cse57 8 (select .cse57 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse59)) (+ (select (select (let ((.cse60 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse58 v_prenex_14)))) (store .cse60 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse61 (store (select .cse60 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_3))) (store .cse61 8 (+ (select .cse61 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse59) .cse62))) (- 1)))) (<= (div (+ (- 1) .cse54) (- 256)) (div (+ (- 1) .cse54 (mod (select .cse55 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)))) (< 9223372036854775807 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (< |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 0) (< 9223372036854775807 .cse62))))))))))) (forall ((v_DerPreprocessor_13 Int) (v_prenex_16 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_17 Int) (v_prenex_2 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_prenex_1 Int)) (let ((.cse71 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse80 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse80 .cse71 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse80) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) (- 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse79 (select .cse76 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse77 (select .cse79 0))) (let ((.cse78 (store (store .cse79 0 (+ (- 1) .cse77)) 8 v_prenex_17))) (let ((.cse68 (store .cse76 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse78))) (let ((.cse67 (select .cse68 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse65 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse75 (mod (select .cse67 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse65) (< .cse65 0) (let ((.cse66 (* (let ((.cse72 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse68 (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse71 v_DerPreprocessor_12)))) (store .cse69 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse70 (store (select .cse69 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_2))) (store .cse70 8 (select .cse70 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse72)) (+ (- 18446744073709551616) (select (select (let ((.cse73 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse71 v_prenex_16)))) (store .cse73 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse74 (store (select .cse73 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_1))) (store .cse74 8 (+ (select .cse74 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse72) .cse75))) (- 1)))) (<= (div (+ (- 1) .cse66) (- 256)) (div (+ (- 1) .cse66 (mod (select .cse67 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256)) (- 256)))) (not (= (select (select .cse76 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse77)) (<= 18446744073709551616 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (<= .cse75 9223372036854775807) (<= (mod (select (select .cse68 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (< 0 (mod (select .cse78 0) 18446744073709551616)) (<= |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 9223372036854775807))))))))))) (forall ((v_DerPreprocessor_13 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_prenex_24 Int)) (let ((.cse91 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse96 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse96 .cse91 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse96) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse95 (select .cse84 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse85 (select .cse95 0))) (let ((.cse82 (store (store .cse95 0 (+ (- 1) .cse85)) 8 v_prenex_24))) (let ((.cse88 (store .cse84 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse82))) (let ((.cse87 (select .cse88 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse81 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse83 (mod (select .cse87 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse81) (< 0 (mod (select .cse82 0) 18446744073709551616)) (<= .cse83 9223372036854775807) (< .cse81 0) (not (= (select (select .cse84 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse85)) (< 9223372036854775807 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (let ((.cse86 (* (let ((.cse92 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse88 (select (select (let ((.cse89 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse91 v_DerPreprocessor_12)))) (store .cse89 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse90 (store (select .cse89 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_23))) (store .cse90 8 (select .cse90 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse92)) (+ (- 18446744073709551616) (select (select (let ((.cse93 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse91 v_prenex_22)))) (store .cse93 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse94 (store (select .cse93 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_25))) (store .cse94 8 (+ (select .cse94 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse92) .cse83))) (- 1)))) (<= (div (+ (- 1) .cse86) (- 256)) (div (+ (- 1) (mod (select .cse87 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) .cse86) (- 256)))) (< |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 0) (<= (mod (select (select .cse88 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0))))))))))) (forall ((v_DerPreprocessor_13 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_33 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse105 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse109 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse112 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse112 .cse105 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse112) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) (- 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse111 (select .cse109 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse110 (select .cse111 0))) (let ((.cse98 (store (store .cse111 0 (+ (- 1) .cse110)) 8 v_prenex_31))) (let ((.cse102 (store .cse109 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse98))) (let ((.cse100 (select .cse102 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse97 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse99 (mod (select .cse100 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse97) (< 0 (mod (select .cse98 0) 18446744073709551616)) (<= .cse99 9223372036854775807) (< .cse97 0) (let ((.cse101 (let ((.cse106 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse102 (select (select (let ((.cse103 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse105 v_DerPreprocessor_12)))) (store .cse103 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse104 (store (select .cse103 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_33))) (store .cse104 8 (select .cse104 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse106)) (+ (- 18446744073709551616) .cse99 (select (select (let ((.cse107 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse105 v_prenex_30)))) (store .cse107 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse108 (store (select .cse107 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_32))) (store .cse108 8 (+ (select .cse108 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse106)))))) (<= (div (+ (mod (select .cse100 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) (* .cse101 (- 1))) (- 256)) (+ (div (+ (- 256) .cse101) 256) 1))) (not (= (select (select .cse109 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse110)) (<= 18446744073709551616 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (<= (mod (select (select .cse102 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0) (<= |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 9223372036854775807))))))))))) (forall ((v_DerPreprocessor_13 Int) (v_prenex_27 Int) (v_prenex_26 Int) (|aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (v_prenex_29 Int) (v_prenex_28 Int) (|aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| Int) (|aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| Int)) (let ((.cse123 (+ |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse116 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (let ((.cse128 (store (select |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| (+ (* |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* |aux_div_ULTIMATE.start_nondet_size_t_#res#1_64| 18446744073709551616))))) (store .cse128 .cse123 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| .cse128) |c_ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ (mod |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 18446744073709551616) |c_ULTIMATE.start_save_byte_from_array_~array#1.offset|))))))) (let ((.cse127 (select .cse116 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|))) (let ((.cse117 (select .cse127 0))) (let ((.cse114 (store (store .cse127 0 (+ (- 1) .cse117)) 8 v_prenex_29))) (let ((.cse120 (store .cse116 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| .cse114))) (let ((.cse118 (select .cse120 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.base|))) (let ((.cse113 (+ |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| (* 18446744073709551616 |aux_div_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|))) (.cse115 (mod (select .cse118 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|) 18446744073709551616))) (or (<= (mod |c_ULTIMATE.start_save_byte_from_array_~size#1| 18446744073709551616) .cse113) (< 0 (mod (select .cse114 0) 18446744073709551616)) (< 9223372036854775807 .cse115) (< .cse113 0) (not (= (select (select .cse116 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) .cse117)) (< 9223372036854775807 |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75|) (let ((.cse119 (let ((.cse124 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|))) (select (select .cse120 (select (select (let ((.cse121 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_14) .cse123 v_DerPreprocessor_12)))) (store .cse121 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse122 (store (select .cse121 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_26))) (store .cse122 8 (select .cse122 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse124)) (+ .cse115 (select (select (let ((.cse125 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base|) |c_ULTIMATE.start_save_byte_from_array_~storage#1.offset| v_DerPreprocessor_13) .cse123 v_prenex_27)))) (store .cse125 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15| (let ((.cse126 (store (select .cse125 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1#1.base_15|) 0 v_prenex_28))) (store .cse126 8 (+ (select .cse126 8) 1))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) .cse124)))))) (<= (div (+ (mod (select .cse118 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#old_byte_from_cur~0#1.offset|)) 256) (* .cse119 (- 1))) (- 256)) (+ (div (+ .cse119 (- 256)) 256) 1))) (< |aux_mod_aux_mod_ULTIMATE.start_nondet_size_t_#res#1_64_75| 0) (<= (mod (select (select .cse120 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3#1.offset|) 18446744073709551616) 0)))))))))))))) is different from true