/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:41:57,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:41:57,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:41:57,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:41:57,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:41:57,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:41:57,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:41:57,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:41:57,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:41:57,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:41:57,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:41:57,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:41:57,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:41:57,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:41:57,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:41:57,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:41:57,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:41:57,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:41:57,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:41:57,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:41:57,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:41:57,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:41:57,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:41:57,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:41:57,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:41:57,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:41:57,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:41:57,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:41:57,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:41:57,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:41:57,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:41:57,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:41:57,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:41:57,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:41:57,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:41:57,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:41:57,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:41:57,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:41:57,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:41:57,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:41:57,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:41:57,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:41:57,841 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:41:57,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:41:57,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:41:57,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:41:57,846 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:41:57,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:41:57,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:41:57,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:41:57,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:41:57,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:41:57,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:41:57,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:41:57,850 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:41:57,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:41:57,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:41:57,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:41:57,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:41:57,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:41:57,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:41:57,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:41:57,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:41:57,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:41:57,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:41:57,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:41:57,852 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:41:57,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 01:41:58,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:41:58,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:41:58,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:41:58,320 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:41:58,321 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:41:58,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2020-12-23 01:41:58,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a8b96d757/eb83ce9baf4543c78ff41bdad505baa3/FLAG73aeb2da2 [2020-12-23 01:41:59,105 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:41:59,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2020-12-23 01:41:59,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a8b96d757/eb83ce9baf4543c78ff41bdad505baa3/FLAG73aeb2da2 [2020-12-23 01:41:59,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a8b96d757/eb83ce9baf4543c78ff41bdad505baa3 [2020-12-23 01:41:59,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:41:59,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:41:59,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:59,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:41:59,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:41:59,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:59" (1/1) ... [2020-12-23 01:41:59,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ca08f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:59, skipping insertion in model container [2020-12-23 01:41:59,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:59" (1/1) ... [2020-12-23 01:41:59,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:41:59,531 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:41:59,830 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42370,42383] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2020-12-23 01:41:59,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:59,873 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:42:00,022 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42370,42383] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2020-12-23 01:42:00,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:42:00,042 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:42:00,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00 WrapperNode [2020-12-23 01:42:00,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:42:00,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:42:00,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:42:00,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:42:00,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (1/1) ... [2020-12-23 01:42:00,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (1/1) ... [2020-12-23 01:42:00,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:42:00,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:42:00,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:42:00,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:42:00,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (1/1) ... [2020-12-23 01:42:00,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (1/1) ... [2020-12-23 01:42:00,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (1/1) ... [2020-12-23 01:42:00,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (1/1) ... [2020-12-23 01:42:00,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (1/1) ... [2020-12-23 01:42:00,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (1/1) ... [2020-12-23 01:42:00,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (1/1) ... [2020-12-23 01:42:00,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:42:00,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:42:00,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:42:00,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:42:00,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:42:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:42:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:42:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:42:00,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:42:00,616 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:42:01,191 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-12-23 01:42:01,192 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-12-23 01:42:01,205 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:42:01,206 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:42:01,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:42:01 BoogieIcfgContainer [2020-12-23 01:42:01,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:42:01,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:42:01,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:42:01,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:42:01,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:41:59" (1/3) ... [2020-12-23 01:42:01,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac404d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:42:01, skipping insertion in model container [2020-12-23 01:42:01,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:42:00" (2/3) ... [2020-12-23 01:42:01,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac404d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:42:01, skipping insertion in model container [2020-12-23 01:42:01,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:42:01" (3/3) ... [2020-12-23 01:42:01,219 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2020-12-23 01:42:01,227 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:42:01,241 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:42:01,278 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:42:01,342 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:42:01,342 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:42:01,342 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:42:01,342 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:42:01,343 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:42:01,343 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:42:01,344 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:42:01,344 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:42:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2020-12-23 01:42:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 01:42:01,390 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:01,391 INFO L422 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] [2020-12-23 01:42:01,391 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:01,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2020-12-23 01:42:01,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:01,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777454300] [2020-12-23 01:42:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:42:01,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777454300] [2020-12-23 01:42:01,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:01,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:01,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001685710] [2020-12-23 01:42:01,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:01,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:01,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:01,745 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2020-12-23 01:42:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:02,148 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2020-12-23 01:42:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:02,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-23 01:42:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:02,164 INFO L225 Difference]: With dead ends: 328 [2020-12-23 01:42:02,165 INFO L226 Difference]: Without dead ends: 175 [2020-12-23 01:42:02,169 INFO L677 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 [2020-12-23 01:42:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-23 01:42:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2020-12-23 01:42:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 01:42:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2020-12-23 01:42:02,234 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2020-12-23 01:42:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:02,234 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2020-12-23 01:42:02,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2020-12-23 01:42:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:42:02,237 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:02,238 INFO L422 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] [2020-12-23 01:42:02,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:42:02,238 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2020-12-23 01:42:02,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:02,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302379036] [2020-12-23 01:42:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:42:02,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302379036] [2020-12-23 01:42:02,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:02,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:02,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912236469] [2020-12-23 01:42:02,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:02,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:02,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:02,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:02,381 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand 3 states. [2020-12-23 01:42:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:02,619 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2020-12-23 01:42:02,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:02,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 01:42:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:02,622 INFO L225 Difference]: With dead ends: 380 [2020-12-23 01:42:02,622 INFO L226 Difference]: Without dead ends: 216 [2020-12-23 01:42:02,624 INFO L677 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 [2020-12-23 01:42:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-12-23 01:42:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2020-12-23 01:42:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-23 01:42:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2020-12-23 01:42:02,645 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2020-12-23 01:42:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:02,645 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2020-12-23 01:42:02,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2020-12-23 01:42:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 01:42:02,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:02,650 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:02,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:42:02,650 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1754997851, now seen corresponding path program 1 times [2020-12-23 01:42:02,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:02,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477912778] [2020-12-23 01:42:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:42:02,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477912778] [2020-12-23 01:42:02,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:02,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:02,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804673847] [2020-12-23 01:42:02,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:02,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:02,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:02,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:02,738 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand 3 states. [2020-12-23 01:42:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:02,897 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2020-12-23 01:42:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:02,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-23 01:42:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:02,901 INFO L225 Difference]: With dead ends: 445 [2020-12-23 01:42:02,901 INFO L226 Difference]: Without dead ends: 242 [2020-12-23 01:42:02,909 INFO L677 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 [2020-12-23 01:42:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-12-23 01:42:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-12-23 01:42:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-23 01:42:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2020-12-23 01:42:02,948 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2020-12-23 01:42:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:02,949 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2020-12-23 01:42:02,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2020-12-23 01:42:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:42:02,959 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:02,959 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:02,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:42:02,960 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:02,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:02,960 INFO L82 PathProgramCache]: Analyzing trace with hash -479038981, now seen corresponding path program 1 times [2020-12-23 01:42:02,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:02,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924825412] [2020-12-23 01:42:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:42:03,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924825412] [2020-12-23 01:42:03,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:03,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:03,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396904496] [2020-12-23 01:42:03,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:03,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:03,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:03,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:03,038 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand 3 states. [2020-12-23 01:42:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:03,178 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2020-12-23 01:42:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:03,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-23 01:42:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:03,181 INFO L225 Difference]: With dead ends: 493 [2020-12-23 01:42:03,181 INFO L226 Difference]: Without dead ends: 259 [2020-12-23 01:42:03,182 INFO L677 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 [2020-12-23 01:42:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-23 01:42:03,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2020-12-23 01:42:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-12-23 01:42:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2020-12-23 01:42:03,195 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2020-12-23 01:42:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:03,195 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2020-12-23 01:42:03,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2020-12-23 01:42:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:42:03,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:03,198 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:03,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:42:03,198 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1816808322, now seen corresponding path program 1 times [2020-12-23 01:42:03,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:03,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576609453] [2020-12-23 01:42:03,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:42:03,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576609453] [2020-12-23 01:42:03,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:03,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:03,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187902994] [2020-12-23 01:42:03,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:03,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:03,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:03,301 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand 3 states. [2020-12-23 01:42:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:03,473 INFO L93 Difference]: Finished difference Result 553 states and 933 transitions. [2020-12-23 01:42:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:03,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-23 01:42:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:03,476 INFO L225 Difference]: With dead ends: 553 [2020-12-23 01:42:03,476 INFO L226 Difference]: Without dead ends: 304 [2020-12-23 01:42:03,477 INFO L677 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 [2020-12-23 01:42:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-12-23 01:42:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2020-12-23 01:42:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-23 01:42:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2020-12-23 01:42:03,488 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2020-12-23 01:42:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:03,488 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2020-12-23 01:42:03,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2020-12-23 01:42:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 01:42:03,490 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:03,490 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:03,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:42:03,491 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:03,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:03,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1697148062, now seen corresponding path program 1 times [2020-12-23 01:42:03,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:03,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345164849] [2020-12-23 01:42:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:42:03,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345164849] [2020-12-23 01:42:03,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:03,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:03,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804947787] [2020-12-23 01:42:03,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:03,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:03,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:03,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:03,544 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand 3 states. [2020-12-23 01:42:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:03,678 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2020-12-23 01:42:03,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:03,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-23 01:42:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:03,681 INFO L225 Difference]: With dead ends: 592 [2020-12-23 01:42:03,681 INFO L226 Difference]: Without dead ends: 301 [2020-12-23 01:42:03,682 INFO L677 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 [2020-12-23 01:42:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-12-23 01:42:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2020-12-23 01:42:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-23 01:42:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2020-12-23 01:42:03,692 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2020-12-23 01:42:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:03,693 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2020-12-23 01:42:03,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2020-12-23 01:42:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 01:42:03,694 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:03,694 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:03,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:42:03,695 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:03,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:03,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1432172412, now seen corresponding path program 1 times [2020-12-23 01:42:03,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:03,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085230199] [2020-12-23 01:42:03,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:42:03,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085230199] [2020-12-23 01:42:03,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:03,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:03,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698734500] [2020-12-23 01:42:03,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:03,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:03,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:03,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:03,770 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand 3 states. [2020-12-23 01:42:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:03,966 INFO L93 Difference]: Finished difference Result 595 states and 997 transitions. [2020-12-23 01:42:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:03,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-23 01:42:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:03,969 INFO L225 Difference]: With dead ends: 595 [2020-12-23 01:42:03,969 INFO L226 Difference]: Without dead ends: 302 [2020-12-23 01:42:03,970 INFO L677 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 [2020-12-23 01:42:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-12-23 01:42:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2020-12-23 01:42:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-12-23 01:42:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2020-12-23 01:42:03,980 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2020-12-23 01:42:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:03,981 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2020-12-23 01:42:03,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2020-12-23 01:42:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:42:03,982 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:03,983 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:03,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:42:03,983 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:03,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1085183485, now seen corresponding path program 1 times [2020-12-23 01:42:03,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:03,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281920467] [2020-12-23 01:42:03,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:42:04,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281920467] [2020-12-23 01:42:04,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:04,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:04,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174373612] [2020-12-23 01:42:04,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:04,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:04,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:04,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:04,075 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand 3 states. [2020-12-23 01:42:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:04,199 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2020-12-23 01:42:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:04,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 01:42:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:04,202 INFO L225 Difference]: With dead ends: 595 [2020-12-23 01:42:04,202 INFO L226 Difference]: Without dead ends: 306 [2020-12-23 01:42:04,203 INFO L677 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 [2020-12-23 01:42:04,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-12-23 01:42:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-12-23 01:42:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-12-23 01:42:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2020-12-23 01:42:04,214 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2020-12-23 01:42:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:04,214 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2020-12-23 01:42:04,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2020-12-23 01:42:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:42:04,216 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:04,216 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:04,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:42:04,217 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:04,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:04,217 INFO L82 PathProgramCache]: Analyzing trace with hash -860132162, now seen corresponding path program 1 times [2020-12-23 01:42:04,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:04,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117919639] [2020-12-23 01:42:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:42:04,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117919639] [2020-12-23 01:42:04,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:04,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:04,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905699459] [2020-12-23 01:42:04,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:04,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:04,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:04,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:04,265 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 3 states. [2020-12-23 01:42:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:04,433 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2020-12-23 01:42:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:04,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-12-23 01:42:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:04,436 INFO L225 Difference]: With dead ends: 635 [2020-12-23 01:42:04,436 INFO L226 Difference]: Without dead ends: 337 [2020-12-23 01:42:04,437 INFO L677 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 [2020-12-23 01:42:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-12-23 01:42:04,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2020-12-23 01:42:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-12-23 01:42:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2020-12-23 01:42:04,448 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2020-12-23 01:42:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:04,448 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2020-12-23 01:42:04,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2020-12-23 01:42:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 01:42:04,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:04,450 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:42:04,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:42:04,451 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1120928325, now seen corresponding path program 1 times [2020-12-23 01:42:04,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:04,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807622320] [2020-12-23 01:42:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:42:04,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807622320] [2020-12-23 01:42:04,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:04,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:04,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926566013] [2020-12-23 01:42:04,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:04,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:04,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:04,511 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 3 states. [2020-12-23 01:42:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:04,687 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2020-12-23 01:42:04,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:04,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-12-23 01:42:04,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:04,690 INFO L225 Difference]: With dead ends: 664 [2020-12-23 01:42:04,690 INFO L226 Difference]: Without dead ends: 337 [2020-12-23 01:42:04,691 INFO L677 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 [2020-12-23 01:42:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-12-23 01:42:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2020-12-23 01:42:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-12-23 01:42:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2020-12-23 01:42:04,703 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2020-12-23 01:42:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:04,703 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2020-12-23 01:42:04,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2020-12-23 01:42:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:42:04,705 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:04,706 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:04,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:42:04,706 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:04,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:04,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1084775058, now seen corresponding path program 1 times [2020-12-23 01:42:04,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:04,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408976766] [2020-12-23 01:42:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:42:04,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408976766] [2020-12-23 01:42:04,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:04,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:04,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313561373] [2020-12-23 01:42:04,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:04,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:04,749 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand 3 states. [2020-12-23 01:42:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:04,912 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2020-12-23 01:42:04,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:04,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 01:42:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:04,915 INFO L225 Difference]: With dead ends: 697 [2020-12-23 01:42:04,915 INFO L226 Difference]: Without dead ends: 370 [2020-12-23 01:42:04,916 INFO L677 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 [2020-12-23 01:42:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-12-23 01:42:04,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2020-12-23 01:42:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-12-23 01:42:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2020-12-23 01:42:04,929 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2020-12-23 01:42:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:04,929 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2020-12-23 01:42:04,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2020-12-23 01:42:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:42:04,931 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:04,931 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:04,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:42:04,932 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1691577195, now seen corresponding path program 1 times [2020-12-23 01:42:04,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:04,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655971899] [2020-12-23 01:42:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 01:42:04,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655971899] [2020-12-23 01:42:04,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:04,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:04,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963930498] [2020-12-23 01:42:04,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:04,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:04,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:04,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:04,991 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 3 states. [2020-12-23 01:42:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:05,176 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2020-12-23 01:42:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:05,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-23 01:42:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:05,179 INFO L225 Difference]: With dead ends: 724 [2020-12-23 01:42:05,180 INFO L226 Difference]: Without dead ends: 370 [2020-12-23 01:42:05,181 INFO L677 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 [2020-12-23 01:42:05,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-12-23 01:42:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2020-12-23 01:42:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-12-23 01:42:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2020-12-23 01:42:05,196 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2020-12-23 01:42:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:05,197 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2020-12-23 01:42:05,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2020-12-23 01:42:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 01:42:05,199 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:05,199 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:05,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:42:05,199 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:05,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:05,200 INFO L82 PathProgramCache]: Analyzing trace with hash -479008336, now seen corresponding path program 1 times [2020-12-23 01:42:05,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:05,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794711420] [2020-12-23 01:42:05,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-23 01:42:05,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794711420] [2020-12-23 01:42:05,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:05,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:05,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7238912] [2020-12-23 01:42:05,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:05,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:05,244 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 3 states. [2020-12-23 01:42:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:05,422 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2020-12-23 01:42:05,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:05,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2020-12-23 01:42:05,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:05,427 INFO L225 Difference]: With dead ends: 741 [2020-12-23 01:42:05,427 INFO L226 Difference]: Without dead ends: 387 [2020-12-23 01:42:05,428 INFO L677 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 [2020-12-23 01:42:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-12-23 01:42:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2020-12-23 01:42:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-12-23 01:42:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2020-12-23 01:42:05,448 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2020-12-23 01:42:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:05,449 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2020-12-23 01:42:05,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2020-12-23 01:42:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:42:05,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:05,451 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:05,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:42:05,451 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:05,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:05,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2118869193, now seen corresponding path program 1 times [2020-12-23 01:42:05,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:05,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415815234] [2020-12-23 01:42:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-23 01:42:05,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415815234] [2020-12-23 01:42:05,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:05,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:05,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701248350] [2020-12-23 01:42:05,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:05,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:05,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:05,508 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 3 states. [2020-12-23 01:42:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:05,721 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2020-12-23 01:42:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:05,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:42:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:05,724 INFO L225 Difference]: With dead ends: 762 [2020-12-23 01:42:05,724 INFO L226 Difference]: Without dead ends: 387 [2020-12-23 01:42:05,725 INFO L677 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 [2020-12-23 01:42:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-12-23 01:42:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2020-12-23 01:42:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-12-23 01:42:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2020-12-23 01:42:05,739 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2020-12-23 01:42:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:05,740 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2020-12-23 01:42:05,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2020-12-23 01:42:05,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 01:42:05,742 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:05,742 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:05,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:42:05,743 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:05,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:05,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1932137040, now seen corresponding path program 1 times [2020-12-23 01:42:05,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:05,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373937076] [2020-12-23 01:42:05,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-23 01:42:05,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373937076] [2020-12-23 01:42:05,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:05,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:05,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376056393] [2020-12-23 01:42:05,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:05,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:05,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:05,821 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand 3 states. [2020-12-23 01:42:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:05,873 INFO L93 Difference]: Finished difference Result 758 states and 1198 transitions. [2020-12-23 01:42:05,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:05,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-12-23 01:42:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:05,877 INFO L225 Difference]: With dead ends: 758 [2020-12-23 01:42:05,878 INFO L226 Difference]: Without dead ends: 756 [2020-12-23 01:42:05,878 INFO L677 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 [2020-12-23 01:42:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2020-12-23 01:42:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2020-12-23 01:42:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2020-12-23 01:42:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1196 transitions. [2020-12-23 01:42:05,908 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1196 transitions. Word has length 121 [2020-12-23 01:42:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:05,908 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 1196 transitions. [2020-12-23 01:42:05,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1196 transitions. [2020-12-23 01:42:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 01:42:05,910 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:05,911 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:05,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:42:05,911 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1552830339, now seen corresponding path program 1 times [2020-12-23 01:42:05,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:05,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117666208] [2020-12-23 01:42:05,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:42:05,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117666208] [2020-12-23 01:42:05,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:05,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:05,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412056805] [2020-12-23 01:42:05,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:05,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:05,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:05,966 INFO L87 Difference]: Start difference. First operand 756 states and 1196 transitions. Second operand 3 states. [2020-12-23 01:42:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:06,023 INFO L93 Difference]: Finished difference Result 1832 states and 2900 transitions. [2020-12-23 01:42:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:06,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-12-23 01:42:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:06,030 INFO L225 Difference]: With dead ends: 1832 [2020-12-23 01:42:06,030 INFO L226 Difference]: Without dead ends: 1084 [2020-12-23 01:42:06,032 INFO L677 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 [2020-12-23 01:42:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2020-12-23 01:42:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2020-12-23 01:42:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2020-12-23 01:42:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1713 transitions. [2020-12-23 01:42:06,073 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1713 transitions. Word has length 122 [2020-12-23 01:42:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:06,074 INFO L481 AbstractCegarLoop]: Abstraction has 1084 states and 1713 transitions. [2020-12-23 01:42:06,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1713 transitions. [2020-12-23 01:42:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 01:42:06,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:06,077 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:06,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:42:06,078 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:06,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:06,078 INFO L82 PathProgramCache]: Analyzing trace with hash 323652479, now seen corresponding path program 1 times [2020-12-23 01:42:06,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:06,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029470588] [2020-12-23 01:42:06,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-23 01:42:06,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029470588] [2020-12-23 01:42:06,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:06,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:06,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118150344] [2020-12-23 01:42:06,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:06,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:06,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:06,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:06,124 INFO L87 Difference]: Start difference. First operand 1084 states and 1713 transitions. Second operand 3 states. [2020-12-23 01:42:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:06,214 INFO L93 Difference]: Finished difference Result 2529 states and 4000 transitions. [2020-12-23 01:42:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:06,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-12-23 01:42:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:06,221 INFO L225 Difference]: With dead ends: 2529 [2020-12-23 01:42:06,221 INFO L226 Difference]: Without dead ends: 1453 [2020-12-23 01:42:06,223 INFO L677 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 [2020-12-23 01:42:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-12-23 01:42:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2020-12-23 01:42:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2020-12-23 01:42:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2295 transitions. [2020-12-23 01:42:06,278 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2295 transitions. Word has length 122 [2020-12-23 01:42:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:06,278 INFO L481 AbstractCegarLoop]: Abstraction has 1453 states and 2295 transitions. [2020-12-23 01:42:06,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2295 transitions. [2020-12-23 01:42:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 01:42:06,282 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:06,282 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:06,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:42:06,282 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:06,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:06,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1712946493, now seen corresponding path program 1 times [2020-12-23 01:42:06,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:06,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149720666] [2020-12-23 01:42:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-12-23 01:42:06,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149720666] [2020-12-23 01:42:06,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:06,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:06,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415649485] [2020-12-23 01:42:06,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:06,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:06,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:06,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:06,323 INFO L87 Difference]: Start difference. First operand 1453 states and 2295 transitions. Second operand 3 states. [2020-12-23 01:42:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:06,404 INFO L93 Difference]: Finished difference Result 3249 states and 5133 transitions. [2020-12-23 01:42:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:06,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-12-23 01:42:06,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:06,414 INFO L225 Difference]: With dead ends: 3249 [2020-12-23 01:42:06,414 INFO L226 Difference]: Without dead ends: 1804 [2020-12-23 01:42:06,417 INFO L677 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 [2020-12-23 01:42:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2020-12-23 01:42:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2020-12-23 01:42:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2020-12-23 01:42:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2846 transitions. [2020-12-23 01:42:06,484 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2846 transitions. Word has length 122 [2020-12-23 01:42:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:06,485 INFO L481 AbstractCegarLoop]: Abstraction has 1804 states and 2846 transitions. [2020-12-23 01:42:06,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2846 transitions. [2020-12-23 01:42:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-12-23 01:42:06,490 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:06,490 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:06,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:42:06,491 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:06,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:06,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1532697181, now seen corresponding path program 1 times [2020-12-23 01:42:06,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:06,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085827536] [2020-12-23 01:42:06,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-23 01:42:06,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085827536] [2020-12-23 01:42:06,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:06,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:06,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016948987] [2020-12-23 01:42:06,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:06,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:06,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:06,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:06,591 INFO L87 Difference]: Start difference. First operand 1804 states and 2846 transitions. Second operand 3 states. [2020-12-23 01:42:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:06,831 INFO L93 Difference]: Finished difference Result 3650 states and 5740 transitions. [2020-12-23 01:42:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:06,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2020-12-23 01:42:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:06,841 INFO L225 Difference]: With dead ends: 3650 [2020-12-23 01:42:06,841 INFO L226 Difference]: Without dead ends: 1854 [2020-12-23 01:42:06,844 INFO L677 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 [2020-12-23 01:42:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2020-12-23 01:42:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1804. [2020-12-23 01:42:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2020-12-23 01:42:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2774 transitions. [2020-12-23 01:42:06,916 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2774 transitions. Word has length 199 [2020-12-23 01:42:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:06,917 INFO L481 AbstractCegarLoop]: Abstraction has 1804 states and 2774 transitions. [2020-12-23 01:42:06,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2774 transitions. [2020-12-23 01:42:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-23 01:42:06,923 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:06,923 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:06,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:42:06,923 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash -995291011, now seen corresponding path program 1 times [2020-12-23 01:42:06,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:06,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029195835] [2020-12-23 01:42:06,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-12-23 01:42:07,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029195835] [2020-12-23 01:42:07,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:07,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:07,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789153433] [2020-12-23 01:42:07,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:07,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:07,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:07,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:07,039 INFO L87 Difference]: Start difference. First operand 1804 states and 2774 transitions. Second operand 3 states. [2020-12-23 01:42:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:07,310 INFO L93 Difference]: Finished difference Result 3667 states and 5613 transitions. [2020-12-23 01:42:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:07,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2020-12-23 01:42:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:07,320 INFO L225 Difference]: With dead ends: 3667 [2020-12-23 01:42:07,320 INFO L226 Difference]: Without dead ends: 1871 [2020-12-23 01:42:07,323 INFO L677 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 [2020-12-23 01:42:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2020-12-23 01:42:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1804. [2020-12-23 01:42:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2020-12-23 01:42:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2698 transitions. [2020-12-23 01:42:07,394 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2698 transitions. Word has length 213 [2020-12-23 01:42:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:07,395 INFO L481 AbstractCegarLoop]: Abstraction has 1804 states and 2698 transitions. [2020-12-23 01:42:07,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2698 transitions. [2020-12-23 01:42:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-23 01:42:07,400 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:07,401 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:07,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:42:07,401 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash -344869126, now seen corresponding path program 1 times [2020-12-23 01:42:07,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:07,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961325218] [2020-12-23 01:42:07,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-23 01:42:07,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961325218] [2020-12-23 01:42:07,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037349434] [2020-12-23 01:42:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:07,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:07,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-23 01:42:08,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:42:08,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 01:42:08,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370679352] [2020-12-23 01:42:08,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:42:08,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:08,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:42:08,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:42:08,079 INFO L87 Difference]: Start difference. First operand 1804 states and 2698 transitions. Second operand 4 states. [2020-12-23 01:42:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:08,526 INFO L93 Difference]: Finished difference Result 4265 states and 6329 transitions. [2020-12-23 01:42:08,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:42:08,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2020-12-23 01:42:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:08,539 INFO L225 Difference]: With dead ends: 4265 [2020-12-23 01:42:08,539 INFO L226 Difference]: Without dead ends: 2436 [2020-12-23 01:42:08,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2020-12-23 01:42:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1604. [2020-12-23 01:42:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2020-12-23 01:42:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2362 transitions. [2020-12-23 01:42:08,623 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2362 transitions. Word has length 232 [2020-12-23 01:42:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:08,623 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2362 transitions. [2020-12-23 01:42:08,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:42:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2362 transitions. [2020-12-23 01:42:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-12-23 01:42:08,630 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:08,631 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:08,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-23 01:42:08,846 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:08,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:08,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1731638989, now seen corresponding path program 1 times [2020-12-23 01:42:08,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:08,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362318733] [2020-12-23 01:42:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2020-12-23 01:42:08,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362318733] [2020-12-23 01:42:08,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:08,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:08,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882383971] [2020-12-23 01:42:08,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:08,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:08,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:08,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:08,946 INFO L87 Difference]: Start difference. First operand 1604 states and 2362 transitions. Second operand 3 states. [2020-12-23 01:42:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:09,164 INFO L93 Difference]: Finished difference Result 3395 states and 5017 transitions. [2020-12-23 01:42:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:09,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2020-12-23 01:42:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:09,173 INFO L225 Difference]: With dead ends: 3395 [2020-12-23 01:42:09,173 INFO L226 Difference]: Without dead ends: 1679 [2020-12-23 01:42:09,176 INFO L677 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 [2020-12-23 01:42:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2020-12-23 01:42:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2020-12-23 01:42:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2020-12-23 01:42:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2427 transitions. [2020-12-23 01:42:09,268 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2427 transitions. Word has length 241 [2020-12-23 01:42:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:09,269 INFO L481 AbstractCegarLoop]: Abstraction has 1679 states and 2427 transitions. [2020-12-23 01:42:09,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2427 transitions. [2020-12-23 01:42:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-12-23 01:42:09,275 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:09,275 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:09,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:42:09,275 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:09,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1272517136, now seen corresponding path program 1 times [2020-12-23 01:42:09,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:09,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468321556] [2020-12-23 01:42:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-12-23 01:42:09,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468321556] [2020-12-23 01:42:09,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614189196] [2020-12-23 01:42:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:09,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:09,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-12-23 01:42:09,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:42:09,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 01:42:09,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710764116] [2020-12-23 01:42:09,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:42:09,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:09,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:42:09,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:42:09,858 INFO L87 Difference]: Start difference. First operand 1679 states and 2427 transitions. Second operand 4 states. [2020-12-23 01:42:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:10,306 INFO L93 Difference]: Finished difference Result 5320 states and 7733 transitions. [2020-12-23 01:42:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:42:10,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2020-12-23 01:42:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:10,324 INFO L225 Difference]: With dead ends: 5320 [2020-12-23 01:42:10,325 INFO L226 Difference]: Without dead ends: 3649 [2020-12-23 01:42:10,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2020-12-23 01:42:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 2004. [2020-12-23 01:42:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2004 states. [2020-12-23 01:42:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2729 transitions. [2020-12-23 01:42:10,440 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2729 transitions. Word has length 253 [2020-12-23 01:42:10,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:10,441 INFO L481 AbstractCegarLoop]: Abstraction has 2004 states and 2729 transitions. [2020-12-23 01:42:10,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:42:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2729 transitions. [2020-12-23 01:42:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-12-23 01:42:10,447 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:10,447 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:10,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 01:42:10,661 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1561336526, now seen corresponding path program 1 times [2020-12-23 01:42:10,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:10,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649610426] [2020-12-23 01:42:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2020-12-23 01:42:10,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649610426] [2020-12-23 01:42:10,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:10,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:10,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033625570] [2020-12-23 01:42:10,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:10,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:10,806 INFO L87 Difference]: Start difference. First operand 2004 states and 2729 transitions. Second operand 3 states. [2020-12-23 01:42:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:10,947 INFO L93 Difference]: Finished difference Result 5742 states and 7864 transitions. [2020-12-23 01:42:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:10,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2020-12-23 01:42:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:10,980 INFO L225 Difference]: With dead ends: 5742 [2020-12-23 01:42:10,980 INFO L226 Difference]: Without dead ends: 3746 [2020-12-23 01:42:10,991 INFO L677 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 [2020-12-23 01:42:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2020-12-23 01:42:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3744. [2020-12-23 01:42:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3744 states. [2020-12-23 01:42:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5134 transitions. [2020-12-23 01:42:11,155 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5134 transitions. Word has length 253 [2020-12-23 01:42:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:11,156 INFO L481 AbstractCegarLoop]: Abstraction has 3744 states and 5134 transitions. [2020-12-23 01:42:11,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5134 transitions. [2020-12-23 01:42:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2020-12-23 01:42:11,165 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:11,165 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:11,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:42:11,166 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash -914284920, now seen corresponding path program 1 times [2020-12-23 01:42:11,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:11,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654922942] [2020-12-23 01:42:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2020-12-23 01:42:11,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654922942] [2020-12-23 01:42:11,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:11,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:11,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777648867] [2020-12-23 01:42:11,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:11,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:11,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:11,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:11,291 INFO L87 Difference]: Start difference. First operand 3744 states and 5134 transitions. Second operand 3 states. [2020-12-23 01:42:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:11,548 INFO L93 Difference]: Finished difference Result 7698 states and 10554 transitions. [2020-12-23 01:42:11,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:11,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2020-12-23 01:42:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:11,558 INFO L225 Difference]: With dead ends: 7698 [2020-12-23 01:42:11,558 INFO L226 Difference]: Without dead ends: 3962 [2020-12-23 01:42:11,564 INFO L677 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 [2020-12-23 01:42:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2020-12-23 01:42:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3744. [2020-12-23 01:42:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3744 states. [2020-12-23 01:42:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5030 transitions. [2020-12-23 01:42:11,733 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5030 transitions. Word has length 256 [2020-12-23 01:42:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:11,733 INFO L481 AbstractCegarLoop]: Abstraction has 3744 states and 5030 transitions. [2020-12-23 01:42:11,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5030 transitions. [2020-12-23 01:42:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2020-12-23 01:42:11,743 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:11,743 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:11,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:42:11,743 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:11,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:11,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1357789354, now seen corresponding path program 1 times [2020-12-23 01:42:11,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:11,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16136163] [2020-12-23 01:42:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2020-12-23 01:42:11,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16136163] [2020-12-23 01:42:11,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:11,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:11,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119045585] [2020-12-23 01:42:11,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:11,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:11,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:11,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:11,875 INFO L87 Difference]: Start difference. First operand 3744 states and 5030 transitions. Second operand 3 states. [2020-12-23 01:42:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:12,097 INFO L93 Difference]: Finished difference Result 7612 states and 10230 transitions. [2020-12-23 01:42:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:12,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2020-12-23 01:42:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:12,106 INFO L225 Difference]: With dead ends: 7612 [2020-12-23 01:42:12,106 INFO L226 Difference]: Without dead ends: 3876 [2020-12-23 01:42:12,111 INFO L677 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 [2020-12-23 01:42:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3876 states. [2020-12-23 01:42:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3876 to 3836. [2020-12-23 01:42:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2020-12-23 01:42:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5142 transitions. [2020-12-23 01:42:12,252 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5142 transitions. Word has length 290 [2020-12-23 01:42:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:12,252 INFO L481 AbstractCegarLoop]: Abstraction has 3836 states and 5142 transitions. [2020-12-23 01:42:12,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5142 transitions. [2020-12-23 01:42:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2020-12-23 01:42:12,263 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:12,264 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:12,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:42:12,264 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:12,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1702375352, now seen corresponding path program 1 times [2020-12-23 01:42:12,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:12,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748356574] [2020-12-23 01:42:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2020-12-23 01:42:12,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748356574] [2020-12-23 01:42:12,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:12,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:12,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651995037] [2020-12-23 01:42:12,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:12,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:12,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:12,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:12,456 INFO L87 Difference]: Start difference. First operand 3836 states and 5142 transitions. Second operand 3 states. [2020-12-23 01:42:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:12,717 INFO L93 Difference]: Finished difference Result 8044 states and 10852 transitions. [2020-12-23 01:42:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:12,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2020-12-23 01:42:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:12,726 INFO L225 Difference]: With dead ends: 8044 [2020-12-23 01:42:12,727 INFO L226 Difference]: Without dead ends: 4216 [2020-12-23 01:42:12,731 INFO L677 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 [2020-12-23 01:42:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2020-12-23 01:42:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 4086. [2020-12-23 01:42:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2020-12-23 01:42:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 5442 transitions. [2020-12-23 01:42:12,880 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 5442 transitions. Word has length 311 [2020-12-23 01:42:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:12,881 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 5442 transitions. [2020-12-23 01:42:12,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 5442 transitions. [2020-12-23 01:42:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2020-12-23 01:42:12,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:12,892 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:12,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 01:42:12,893 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 602793911, now seen corresponding path program 1 times [2020-12-23 01:42:12,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:12,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279594893] [2020-12-23 01:42:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2020-12-23 01:42:13,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279594893] [2020-12-23 01:42:13,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:13,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:13,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31969648] [2020-12-23 01:42:13,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:13,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:13,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:13,042 INFO L87 Difference]: Start difference. First operand 4086 states and 5442 transitions. Second operand 3 states. [2020-12-23 01:42:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:13,224 INFO L93 Difference]: Finished difference Result 6855 states and 9019 transitions. [2020-12-23 01:42:13,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:13,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2020-12-23 01:42:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:13,229 INFO L225 Difference]: With dead ends: 6855 [2020-12-23 01:42:13,230 INFO L226 Difference]: Without dead ends: 2133 [2020-12-23 01:42:13,235 INFO L677 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 [2020-12-23 01:42:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2020-12-23 01:42:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2133. [2020-12-23 01:42:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2020-12-23 01:42:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2774 transitions. [2020-12-23 01:42:13,310 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2774 transitions. Word has length 321 [2020-12-23 01:42:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:13,310 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2774 transitions. [2020-12-23 01:42:13,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2774 transitions. [2020-12-23 01:42:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2020-12-23 01:42:13,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:13,315 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:13,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:42:13,315 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash -616309997, now seen corresponding path program 1 times [2020-12-23 01:42:13,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:13,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099211751] [2020-12-23 01:42:13,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2020-12-23 01:42:13,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099211751] [2020-12-23 01:42:13,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:13,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:13,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796923071] [2020-12-23 01:42:13,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:13,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:13,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:13,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:13,439 INFO L87 Difference]: Start difference. First operand 2133 states and 2774 transitions. Second operand 3 states. [2020-12-23 01:42:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:13,631 INFO L93 Difference]: Finished difference Result 4298 states and 5601 transitions. [2020-12-23 01:42:13,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:13,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2020-12-23 01:42:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:13,637 INFO L225 Difference]: With dead ends: 4298 [2020-12-23 01:42:13,637 INFO L226 Difference]: Without dead ends: 2173 [2020-12-23 01:42:13,640 INFO L677 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 [2020-12-23 01:42:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2020-12-23 01:42:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2133. [2020-12-23 01:42:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2020-12-23 01:42:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2734 transitions. [2020-12-23 01:42:13,708 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2734 transitions. Word has length 337 [2020-12-23 01:42:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:13,708 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2734 transitions. [2020-12-23 01:42:13,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2734 transitions. [2020-12-23 01:42:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2020-12-23 01:42:13,713 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:13,714 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:13,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:42:13,714 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:13,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:13,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1063549815, now seen corresponding path program 1 times [2020-12-23 01:42:13,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:13,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638330828] [2020-12-23 01:42:13,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2020-12-23 01:42:13,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638330828] [2020-12-23 01:42:13,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:13,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:13,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904508502] [2020-12-23 01:42:13,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:13,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:13,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:13,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:13,854 INFO L87 Difference]: Start difference. First operand 2133 states and 2734 transitions. Second operand 3 states. [2020-12-23 01:42:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:14,025 INFO L93 Difference]: Finished difference Result 4268 states and 5466 transitions. [2020-12-23 01:42:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:14,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2020-12-23 01:42:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:14,031 INFO L225 Difference]: With dead ends: 4268 [2020-12-23 01:42:14,031 INFO L226 Difference]: Without dead ends: 2143 [2020-12-23 01:42:14,034 INFO L677 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 [2020-12-23 01:42:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2020-12-23 01:42:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2133. [2020-12-23 01:42:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2020-12-23 01:42:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2694 transitions. [2020-12-23 01:42:14,122 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2694 transitions. Word has length 360 [2020-12-23 01:42:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:14,122 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2694 transitions. [2020-12-23 01:42:14,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2694 transitions. [2020-12-23 01:42:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2020-12-23 01:42:14,127 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:14,127 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:14,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 01:42:14,128 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:14,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2107174257, now seen corresponding path program 1 times [2020-12-23 01:42:14,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:14,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118535558] [2020-12-23 01:42:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-12-23 01:42:14,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118535558] [2020-12-23 01:42:14,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037272833] [2020-12-23 01:42:14,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:14,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:14,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2020-12-23 01:42:14,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:42:14,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 01:42:14,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142411402] [2020-12-23 01:42:14,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:14,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:14,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:14,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:14,939 INFO L87 Difference]: Start difference. First operand 2133 states and 2694 transitions. Second operand 3 states. [2020-12-23 01:42:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:15,009 INFO L93 Difference]: Finished difference Result 2711 states and 3448 transitions. [2020-12-23 01:42:15,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:15,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2020-12-23 01:42:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:15,016 INFO L225 Difference]: With dead ends: 2711 [2020-12-23 01:42:15,016 INFO L226 Difference]: Without dead ends: 2573 [2020-12-23 01:42:15,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2020-12-23 01:42:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1997. [2020-12-23 01:42:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2020-12-23 01:42:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2540 transitions. [2020-12-23 01:42:15,089 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2540 transitions. Word has length 393 [2020-12-23 01:42:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:15,090 INFO L481 AbstractCegarLoop]: Abstraction has 1997 states and 2540 transitions. [2020-12-23 01:42:15,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2540 transitions. [2020-12-23 01:42:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2020-12-23 01:42:15,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:15,094 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:15,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:15,308 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:15,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2021892229, now seen corresponding path program 1 times [2020-12-23 01:42:15,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:15,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894951109] [2020-12-23 01:42:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2020-12-23 01:42:15,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894951109] [2020-12-23 01:42:15,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622070500] [2020-12-23 01:42:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:15,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:15,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2020-12-23 01:42:15,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:42:15,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 01:42:15,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353538193] [2020-12-23 01:42:16,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:42:16,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:16,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:42:16,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:42:16,005 INFO L87 Difference]: Start difference. First operand 1997 states and 2540 transitions. Second operand 4 states. [2020-12-23 01:42:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:16,367 INFO L93 Difference]: Finished difference Result 5016 states and 6404 transitions. [2020-12-23 01:42:16,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:42:16,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2020-12-23 01:42:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:16,375 INFO L225 Difference]: With dead ends: 5016 [2020-12-23 01:42:16,375 INFO L226 Difference]: Without dead ends: 2985 [2020-12-23 01:42:16,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-12-23 01:42:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2157. [2020-12-23 01:42:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-12-23 01:42:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 2760 transitions. [2020-12-23 01:42:16,456 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 2760 transitions. Word has length 409 [2020-12-23 01:42:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:16,456 INFO L481 AbstractCegarLoop]: Abstraction has 2157 states and 2760 transitions. [2020-12-23 01:42:16,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:42:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2760 transitions. [2020-12-23 01:42:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2020-12-23 01:42:16,461 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:16,462 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:16,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:16,667 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:16,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1865506571, now seen corresponding path program 1 times [2020-12-23 01:42:16,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:16,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242426729] [2020-12-23 01:42:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2020-12-23 01:42:16,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242426729] [2020-12-23 01:42:16,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:16,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:16,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279880108] [2020-12-23 01:42:16,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:16,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:16,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:16,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:16,932 INFO L87 Difference]: Start difference. First operand 2157 states and 2760 transitions. Second operand 3 states. [2020-12-23 01:42:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:17,130 INFO L93 Difference]: Finished difference Result 4486 states and 5763 transitions. [2020-12-23 01:42:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:17,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 471 [2020-12-23 01:42:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:17,136 INFO L225 Difference]: With dead ends: 4486 [2020-12-23 01:42:17,136 INFO L226 Difference]: Without dead ends: 2337 [2020-12-23 01:42:17,138 INFO L677 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 [2020-12-23 01:42:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2020-12-23 01:42:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2327. [2020-12-23 01:42:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2020-12-23 01:42:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 2955 transitions. [2020-12-23 01:42:17,218 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 2955 transitions. Word has length 471 [2020-12-23 01:42:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:17,219 INFO L481 AbstractCegarLoop]: Abstraction has 2327 states and 2955 transitions. [2020-12-23 01:42:17,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2955 transitions. [2020-12-23 01:42:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2020-12-23 01:42:17,225 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:17,225 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:17,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 01:42:17,226 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1625661125, now seen corresponding path program 1 times [2020-12-23 01:42:17,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:17,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588483473] [2020-12-23 01:42:17,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2020-12-23 01:42:17,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588483473] [2020-12-23 01:42:17,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:42:17,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:42:17,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515582139] [2020-12-23 01:42:17,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:42:17,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:42:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:42:17,524 INFO L87 Difference]: Start difference. First operand 2327 states and 2955 transitions. Second operand 3 states. [2020-12-23 01:42:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:17,746 INFO L93 Difference]: Finished difference Result 4641 states and 5888 transitions. [2020-12-23 01:42:17,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:42:17,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 533 [2020-12-23 01:42:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:17,753 INFO L225 Difference]: With dead ends: 4641 [2020-12-23 01:42:17,753 INFO L226 Difference]: Without dead ends: 2322 [2020-12-23 01:42:17,757 INFO L677 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 [2020-12-23 01:42:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2020-12-23 01:42:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2020-12-23 01:42:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2020-12-23 01:42:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 2885 transitions. [2020-12-23 01:42:17,855 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 2885 transitions. Word has length 533 [2020-12-23 01:42:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:17,856 INFO L481 AbstractCegarLoop]: Abstraction has 2322 states and 2885 transitions. [2020-12-23 01:42:17,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:42:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2885 transitions. [2020-12-23 01:42:17,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-12-23 01:42:17,865 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:42:17,865 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:42:17,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 01:42:17,866 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:42:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:42:17,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1600887189, now seen corresponding path program 1 times [2020-12-23 01:42:17,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:42:17,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39330576] [2020-12-23 01:42:17,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:42:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2020-12-23 01:42:18,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39330576] [2020-12-23 01:42:18,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442182404] [2020-12-23 01:42:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:42:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:42:18,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 01:42:18,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:42:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2020-12-23 01:42:18,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:42:18,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 01:42:18,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129051870] [2020-12-23 01:42:18,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:42:18,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:42:18,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:42:18,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:42:18,975 INFO L87 Difference]: Start difference. First operand 2322 states and 2885 transitions. Second operand 4 states. [2020-12-23 01:42:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:42:19,197 INFO L93 Difference]: Finished difference Result 3917 states and 4895 transitions. [2020-12-23 01:42:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:42:19,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2020-12-23 01:42:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:42:19,199 INFO L225 Difference]: With dead ends: 3917 [2020-12-23 01:42:19,199 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 01:42:19,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:42:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 01:42:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 01:42:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 01:42:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 01:42:19,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2020-12-23 01:42:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:42:19,204 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 01:42:19,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:42:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 01:42:19,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 01:42:19,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-23 01:42:19,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 01:42:20,579 WARN L197 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 208 [2020-12-23 01:42:21,495 WARN L197 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 208 [2020-12-23 01:42:22,130 WARN L197 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2020-12-23 01:42:22,421 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 34 [2020-12-23 01:42:22,711 WARN L197 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-12-23 01:42:23,304 WARN L197 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2020-12-23 01:42:26,551 WARN L197 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 172 DAG size of output: 106 [2020-12-23 01:42:27,208 WARN L197 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2020-12-23 01:42:27,633 WARN L197 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-12-23 01:42:27,941 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 22 [2020-12-23 01:42:28,368 WARN L197 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2020-12-23 01:42:28,867 WARN L197 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2020-12-23 01:42:32,101 WARN L197 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 172 DAG size of output: 106 [2020-12-23 01:42:32,539 WARN L197 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2020-12-23 01:42:33,145 WARN L197 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2020-12-23 01:42:33,486 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2020-12-23 01:42:33,804 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-12-23 01:42:34,227 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2020-12-23 01:42:34,634 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2020-12-23 01:42:34,945 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-12-23 01:42:35,196 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 24 [2020-12-23 01:42:35,854 WARN L197 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2020-12-23 01:42:36,111 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 19 [2020-12-23 01:42:36,116 INFO L189 CegarLoopUtils]: For program point L531(lines 531 537) no Hoare annotation was computed. [2020-12-23 01:42:36,116 INFO L189 CegarLoopUtils]: For program point L531-1(lines 531 537) no Hoare annotation was computed. [2020-12-23 01:42:36,116 INFO L189 CegarLoopUtils]: For program point L334(lines 334 368) no Hoare annotation was computed. [2020-12-23 01:42:36,116 INFO L189 CegarLoopUtils]: For program point L334-1(lines 334 368) no Hoare annotation was computed. [2020-12-23 01:42:36,116 INFO L189 CegarLoopUtils]: For program point L202(lines 202 547) no Hoare annotation was computed. [2020-12-23 01:42:36,117 INFO L189 CegarLoopUtils]: For program point L169(lines 169 558) no Hoare annotation was computed. [2020-12-23 01:42:36,117 INFO L189 CegarLoopUtils]: For program point L136(lines 136 569) no Hoare annotation was computed. [2020-12-23 01:42:36,117 INFO L189 CegarLoopUtils]: For program point L103(lines 103 580) no Hoare annotation was computed. [2020-12-23 01:42:36,117 INFO L189 CegarLoopUtils]: For program point L467(lines 467 469) no Hoare annotation was computed. [2020-12-23 01:42:36,117 INFO L189 CegarLoopUtils]: For program point L401(lines 401 403) no Hoare annotation was computed. [2020-12-23 01:42:36,117 INFO L189 CegarLoopUtils]: For program point L335(lines 335 365) no Hoare annotation was computed. [2020-12-23 01:42:36,118 INFO L185 CegarLoopUtils]: At program point L203(lines 199 548) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse2 .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse0 .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1))) [2020-12-23 01:42:36,118 INFO L185 CegarLoopUtils]: At program point L104(lines 103 580) the Hoare annotation is: false [2020-12-23 01:42:36,118 INFO L192 CegarLoopUtils]: At program point L600(lines 99 601) the Hoare annotation is: true [2020-12-23 01:42:36,119 INFO L189 CegarLoopUtils]: For program point L534(lines 534 536) no Hoare annotation was computed. [2020-12-23 01:42:36,119 INFO L189 CegarLoopUtils]: For program point L205(lines 205 546) no Hoare annotation was computed. [2020-12-23 01:42:36,119 INFO L189 CegarLoopUtils]: For program point L172(lines 172 557) no Hoare annotation was computed. [2020-12-23 01:42:36,119 INFO L189 CegarLoopUtils]: For program point L139(lines 139 568) no Hoare annotation was computed. [2020-12-23 01:42:36,119 INFO L189 CegarLoopUtils]: For program point L106(lines 106 579) no Hoare annotation was computed. [2020-12-23 01:42:36,119 INFO L189 CegarLoopUtils]: For program point L305(lines 305 312) no Hoare annotation was computed. [2020-12-23 01:42:36,119 INFO L189 CegarLoopUtils]: For program point L305-2(lines 305 312) no Hoare annotation was computed. [2020-12-23 01:42:36,119 INFO L185 CegarLoopUtils]: At program point L206(lines 205 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2020-12-23 01:42:36,119 INFO L185 CegarLoopUtils]: At program point L173(lines 169 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2 .cse5 .cse6 .cse7 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-12-23 01:42:36,120 INFO L185 CegarLoopUtils]: At program point L140(lines 136 569) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-23 01:42:36,120 INFO L189 CegarLoopUtils]: For program point L340(lines 340 363) no Hoare annotation was computed. [2020-12-23 01:42:36,120 INFO L185 CegarLoopUtils]: At program point L208(lines 207 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2020-12-23 01:42:36,120 INFO L189 CegarLoopUtils]: For program point L175(lines 175 556) no Hoare annotation was computed. [2020-12-23 01:42:36,120 INFO L189 CegarLoopUtils]: For program point L142(lines 142 567) no Hoare annotation was computed. [2020-12-23 01:42:36,120 INFO L189 CegarLoopUtils]: For program point L109(lines 109 578) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L605(lines 605 607) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L605-2(lines 605 607) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L506(lines 506 509) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L275(lines 275 277) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L275-2(lines 209 543) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L441(lines 441 443) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L309(lines 309 311) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L343(lines 343 347) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L343-2(lines 343 347) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L244(lines 244 254) no Hoare annotation was computed. [2020-12-23 01:42:36,121 INFO L189 CegarLoopUtils]: For program point L178(lines 178 555) no Hoare annotation was computed. [2020-12-23 01:42:36,122 INFO L189 CegarLoopUtils]: For program point L145(lines 145 566) no Hoare annotation was computed. [2020-12-23 01:42:36,122 INFO L189 CegarLoopUtils]: For program point L112(lines 112 577) no Hoare annotation was computed. [2020-12-23 01:42:36,122 INFO L189 CegarLoopUtils]: For program point L476(lines 476 478) no Hoare annotation was computed. [2020-12-23 01:42:36,122 INFO L189 CegarLoopUtils]: For program point L377(lines 377 409) no Hoare annotation was computed. [2020-12-23 01:42:36,122 INFO L189 CegarLoopUtils]: For program point L245(lines 245 248) no Hoare annotation was computed. [2020-12-23 01:42:36,122 INFO L185 CegarLoopUtils]: At program point L212(lines 106 579) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2020-12-23 01:42:36,122 INFO L185 CegarLoopUtils]: At program point L179(lines 175 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2 .cse5 .cse6 .cse7 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-12-23 01:42:36,123 INFO L185 CegarLoopUtils]: At program point L146(lines 142 567) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-12-23 01:42:36,123 INFO L189 CegarLoopUtils]: For program point L444(lines 444 453) no Hoare annotation was computed. [2020-12-23 01:42:36,123 INFO L189 CegarLoopUtils]: For program point L378(lines 378 384) no Hoare annotation was computed. [2020-12-23 01:42:36,123 INFO L192 CegarLoopUtils]: At program point L610(lines 12 612) the Hoare annotation is: true [2020-12-23 01:42:36,123 INFO L185 CegarLoopUtils]: At program point L544(lines 100 599) the Hoare annotation is: (let ((.cse22 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse26 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse23 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse24 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse25 (not .cse4)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse10 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not .cse26)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse30 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not .cse22)) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse5) (and .cse0 .cse4 .cse6 .cse5) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse9 .cse20) (and .cse0 .cse9 .cse6) (and .cse21 .cse22) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse6 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse23 .cse18 .cse24 .cse25) (and .cse21 .cse26) (and .cse23 .cse20) (and .cse9 .cse18 .cse24) (and .cse7 .cse8 .cse9 .cse17 .cse10 .cse12 .cse6 .cse14 .cse19) (and .cse27 .cse23 .cse14 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse25) (and .cse0 .cse13 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse27 .cse4 .cse14) (and .cse2 .cse9 .cse28 .cse4 .cse24) (and .cse0 .cse2 .cse28 .cse24 .cse29 .cse5) (and .cse1 .cse2 .cse3 .cse25) (and .cse4 .cse26 .cse5) (and .cse0 .cse30 .cse4 .cse5) (and .cse21 .cse2 .cse28 .cse24) (and .cse5 .cse20) (and .cse0 .cse21 .cse6) (and .cse2 .cse28 .cse24 .cse29 .cse5 .cse25) (and .cse21 .cse20) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse4 .cse5) (and .cse4 .cse22 .cse5) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L181(lines 181 554) no Hoare annotation was computed. [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L148(lines 148 565) no Hoare annotation was computed. [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L115(lines 115 576) no Hoare annotation was computed. [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L479(lines 479 483) no Hoare annotation was computed. [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L479-2(lines 479 483) no Hoare annotation was computed. [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L83(lines 83 89) no Hoare annotation was computed. [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L514(lines 514 516) no Hoare annotation was computed. [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L448(lines 448 450) no Hoare annotation was computed. [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L217(lines 217 219) no Hoare annotation was computed. [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L184(lines 184 553) no Hoare annotation was computed. [2020-12-23 01:42:36,124 INFO L189 CegarLoopUtils]: For program point L151(lines 151 564) no Hoare annotation was computed. [2020-12-23 01:42:36,125 INFO L189 CegarLoopUtils]: For program point L217-2(lines 217 219) no Hoare annotation was computed. [2020-12-23 01:42:36,125 INFO L189 CegarLoopUtils]: For program point L118(lines 118 575) no Hoare annotation was computed. [2020-12-23 01:42:36,125 INFO L189 CegarLoopUtils]: For program point L581(lines 581 597) no Hoare annotation was computed. [2020-12-23 01:42:36,125 INFO L185 CegarLoopUtils]: At program point L515(lines 73 611) the Hoare annotation is: false [2020-12-23 01:42:36,125 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 01:42:36,125 INFO L185 CegarLoopUtils]: At program point L185(lines 181 554) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0))) [2020-12-23 01:42:36,125 INFO L185 CegarLoopUtils]: At program point L152(lines 148 565) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-12-23 01:42:36,125 INFO L189 CegarLoopUtils]: For program point L86(lines 86 88) no Hoare annotation was computed. [2020-12-23 01:42:36,125 INFO L189 CegarLoopUtils]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2020-12-23 01:42:36,126 INFO L189 CegarLoopUtils]: For program point L582(lines 582 596) no Hoare annotation was computed. [2020-12-23 01:42:36,126 INFO L189 CegarLoopUtils]: For program point L351(lines 351 359) no Hoare annotation was computed. [2020-12-23 01:42:36,126 INFO L189 CegarLoopUtils]: For program point L583(lines 583 588) no Hoare annotation was computed. [2020-12-23 01:42:36,126 INFO L189 CegarLoopUtils]: For program point L517(lines 517 519) no Hoare annotation was computed. [2020-12-23 01:42:36,126 INFO L189 CegarLoopUtils]: For program point L583-2(lines 582 596) no Hoare annotation was computed. [2020-12-23 01:42:36,126 INFO L185 CegarLoopUtils]: At program point L352(lines 328 370) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-12-23 01:42:36,126 INFO L189 CegarLoopUtils]: For program point L187(lines 187 552) no Hoare annotation was computed. [2020-12-23 01:42:36,126 INFO L189 CegarLoopUtils]: For program point L154(lines 154 563) no Hoare annotation was computed. [2020-12-23 01:42:36,126 INFO L189 CegarLoopUtils]: For program point L121(lines 121 574) no Hoare annotation was computed. [2020-12-23 01:42:36,127 INFO L189 CegarLoopUtils]: For program point L419(lines 419 421) no Hoare annotation was computed. [2020-12-23 01:42:36,127 INFO L185 CegarLoopUtils]: At program point L386(lines 377 409) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-12-23 01:42:36,127 INFO L185 CegarLoopUtils]: At program point L122(lines 118 575) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse1 .cse0 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse0 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-23 01:42:36,127 INFO L189 CegarLoopUtils]: For program point L585(lines 585 587) no Hoare annotation was computed. [2020-12-23 01:42:36,127 INFO L189 CegarLoopUtils]: For program point L354(lines 354 356) no Hoare annotation was computed. [2020-12-23 01:42:36,127 INFO L189 CegarLoopUtils]: For program point L288(lines 288 290) no Hoare annotation was computed. [2020-12-23 01:42:36,127 INFO L189 CegarLoopUtils]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-23 01:42:36,127 INFO L189 CegarLoopUtils]: For program point L288-2(lines 209 543) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point L322-2(lines 209 543) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point L190(lines 190 551) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point L157(lines 157 562) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point L124(lines 124 573) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point L91(lines 91 95) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point L91-1(lines 73 611) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point L521(lines 521 525) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2020-12-23 01:42:36,128 INFO L189 CegarLoopUtils]: For program point L389(lines 389 407) no Hoare annotation was computed. [2020-12-23 01:42:36,129 INFO L185 CegarLoopUtils]: At program point L191(lines 187 552) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2020-12-23 01:42:36,129 INFO L185 CegarLoopUtils]: At program point L158(lines 154 563) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-12-23 01:42:36,129 INFO L185 CegarLoopUtils]: At program point L125(lines 124 573) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-12-23 01:42:36,129 INFO L189 CegarLoopUtils]: For program point L92(lines 92 94) no Hoare annotation was computed. [2020-12-23 01:42:36,129 INFO L189 CegarLoopUtils]: For program point L489(lines 489 492) no Hoare annotation was computed. [2020-12-23 01:42:36,129 INFO L189 CegarLoopUtils]: For program point L390(lines 390 396) no Hoare annotation was computed. [2020-12-23 01:42:36,129 INFO L192 CegarLoopUtils]: At program point L622(lines 613 624) the Hoare annotation is: true [2020-12-23 01:42:36,129 INFO L189 CegarLoopUtils]: For program point L193(lines 193 550) no Hoare annotation was computed. [2020-12-23 01:42:36,130 INFO L189 CegarLoopUtils]: For program point L160(lines 160 561) no Hoare annotation was computed. [2020-12-23 01:42:36,130 INFO L189 CegarLoopUtils]: For program point L127(lines 127 572) no Hoare annotation was computed. [2020-12-23 01:42:36,130 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 01:42:36,130 INFO L189 CegarLoopUtils]: For program point L590(lines 590 594) no Hoare annotation was computed. [2020-12-23 01:42:36,130 INFO L189 CegarLoopUtils]: For program point L458(lines 458 460) no Hoare annotation was computed. [2020-12-23 01:42:36,130 INFO L189 CegarLoopUtils]: For program point L260(lines 260 262) no Hoare annotation was computed. [2020-12-23 01:42:36,130 INFO L189 CegarLoopUtils]: For program point L227(lines 227 238) no Hoare annotation was computed. [2020-12-23 01:42:36,130 INFO L189 CegarLoopUtils]: For program point L227-2(lines 209 543) no Hoare annotation was computed. [2020-12-23 01:42:36,130 INFO L189 CegarLoopUtils]: For program point L294(lines 294 298) no Hoare annotation was computed. [2020-12-23 01:42:36,130 INFO L189 CegarLoopUtils]: For program point L294-2(lines 294 298) no Hoare annotation was computed. [2020-12-23 01:42:36,131 INFO L189 CegarLoopUtils]: For program point L427-1(lines 427 435) no Hoare annotation was computed. [2020-12-23 01:42:36,131 INFO L189 CegarLoopUtils]: For program point L229(lines 229 232) no Hoare annotation was computed. [2020-12-23 01:42:36,131 INFO L189 CegarLoopUtils]: For program point L196(lines 196 549) no Hoare annotation was computed. [2020-12-23 01:42:36,131 INFO L189 CegarLoopUtils]: For program point L163(lines 163 560) no Hoare annotation was computed. [2020-12-23 01:42:36,131 INFO L189 CegarLoopUtils]: For program point L130(lines 130 571) no Hoare annotation was computed. [2020-12-23 01:42:36,131 INFO L189 CegarLoopUtils]: For program point L494(lines 494 500) no Hoare annotation was computed. [2020-12-23 01:42:36,131 INFO L185 CegarLoopUtils]: At program point L197(lines 193 550) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5)))) [2020-12-23 01:42:36,131 INFO L185 CegarLoopUtils]: At program point L164(lines 160 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-12-23 01:42:36,132 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 01:42:36,132 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 609) no Hoare annotation was computed. [2020-12-23 01:42:36,132 INFO L189 CegarLoopUtils]: For program point L430(lines 430 433) no Hoare annotation was computed. [2020-12-23 01:42:36,132 INFO L189 CegarLoopUtils]: For program point L331(lines 331 369) no Hoare annotation was computed. [2020-12-23 01:42:36,132 INFO L189 CegarLoopUtils]: For program point L199(lines 199 548) no Hoare annotation was computed. [2020-12-23 01:42:36,132 INFO L189 CegarLoopUtils]: For program point L166(lines 166 559) no Hoare annotation was computed. [2020-12-23 01:42:36,132 INFO L189 CegarLoopUtils]: For program point L133(lines 133 570) no Hoare annotation was computed. [2020-12-23 01:42:36,133 INFO L185 CegarLoopUtils]: At program point L100-2(lines 100 599) the Hoare annotation is: (let ((.cse22 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse26 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse23 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse24 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse25 (not .cse4)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse10 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not .cse26)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse30 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not .cse22)) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse5) (and .cse0 .cse4 .cse6 .cse5) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse9 .cse20) (and .cse0 .cse9 .cse6) (and .cse21 .cse22) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse6 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse23 .cse18 .cse24 .cse25) (and .cse21 .cse26) (and .cse23 .cse20) (and .cse9 .cse18 .cse24) (and .cse7 .cse8 .cse9 .cse17 .cse10 .cse12 .cse6 .cse14 .cse19) (and .cse27 .cse23 .cse14 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse25) (and .cse0 .cse13 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse27 .cse4 .cse14) (and .cse2 .cse9 .cse28 .cse4 .cse24) (and .cse0 .cse2 .cse28 .cse24 .cse29 .cse5) (and .cse1 .cse2 .cse3 .cse25) (and .cse4 .cse26 .cse5) (and .cse0 .cse30 .cse4 .cse5) (and .cse21 .cse2 .cse28 .cse24) (and .cse5 .cse20) (and .cse0 .cse21 .cse6) (and .cse2 .cse28 .cse24 .cse29 .cse5 .cse25) (and .cse21 .cse20) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse4 .cse5) (and .cse4 .cse22 .cse5) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2020-12-23 01:42:36,133 INFO L189 CegarLoopUtils]: For program point L497(lines 497 499) no Hoare annotation was computed. [2020-12-23 01:42:36,133 INFO L189 CegarLoopUtils]: For program point L497-2(lines 209 543) no Hoare annotation was computed. [2020-12-23 01:42:36,133 INFO L185 CegarLoopUtils]: At program point L398(lines 389 407) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-12-23 01:42:36,133 INFO L189 CegarLoopUtils]: For program point L233(lines 233 236) no Hoare annotation was computed. [2020-12-23 01:42:36,133 INFO L185 CegarLoopUtils]: At program point L167(lines 166 559) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (not .cse2)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3))) [2020-12-23 01:42:36,134 INFO L185 CegarLoopUtils]: At program point L134(lines 127 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-12-23 01:42:36,134 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-23 01:42:36,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:42:36 BoogieIcfgContainer [2020-12-23 01:42:36,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:42:36,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:42:36,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:42:36,201 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:42:36,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:42:01" (3/4) ... [2020-12-23 01:42:36,205 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 01:42:36,241 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-23 01:42:36,242 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 01:42:36,243 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 01:42:36,247 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 01:42:36,372 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_4.cil.c-witness.graphml [2020-12-23 01:42:36,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:42:36,373 INFO L168 Benchmark]: Toolchain (without parser) took 36933.34 ms. Allocated memory was 167.8 MB in the beginning and 833.6 MB in the end (delta: 665.8 MB). Free memory was 143.4 MB in the beginning and 360.7 MB in the end (delta: -217.4 MB). Peak memory consumption was 448.8 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:36,373 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 167.8 MB. Free memory is still 143.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:42:36,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.54 ms. Allocated memory is still 167.8 MB. Free memory was 143.1 MB in the beginning and 127.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:36,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.61 ms. Allocated memory is still 167.8 MB. Free memory was 127.6 MB in the beginning and 124.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:36,374 INFO L168 Benchmark]: Boogie Preprocessor took 68.05 ms. Allocated memory is still 167.8 MB. Free memory was 124.8 MB in the beginning and 122.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:36,375 INFO L168 Benchmark]: RCFGBuilder took 1025.92 ms. Allocated memory is still 167.8 MB. Free memory was 122.7 MB in the beginning and 125.7 MB in the end (delta: -3.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:36,375 INFO L168 Benchmark]: TraceAbstraction took 34989.85 ms. Allocated memory was 167.8 MB in the beginning and 833.6 MB in the end (delta: 665.8 MB). Free memory was 125.7 MB in the beginning and 373.8 MB in the end (delta: -248.1 MB). Peak memory consumption was 483.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:36,376 INFO L168 Benchmark]: Witness Printer took 171.68 ms. Allocated memory is still 833.6 MB. Free memory was 373.8 MB in the beginning and 360.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:42:36,378 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 167.8 MB. Free memory is still 143.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 601.54 ms. Allocated memory is still 167.8 MB. Free memory was 143.1 MB in the beginning and 127.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 68.61 ms. Allocated memory is still 167.8 MB. Free memory was 127.6 MB in the beginning and 124.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.05 ms. Allocated memory is still 167.8 MB. Free memory was 124.8 MB in the beginning and 122.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1025.92 ms. Allocated memory is still 167.8 MB. Free memory was 122.7 MB in the beginning and 125.7 MB in the end (delta: -3.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 34989.85 ms. Allocated memory was 167.8 MB in the beginning and 833.6 MB in the end (delta: 665.8 MB). Free memory was 125.7 MB in the beginning and 373.8 MB in the end (delta: -248.1 MB). Peak memory consumption was 483.7 MB. Max. memory is 8.0 GB. * Witness Printer took 171.68 ms. Allocated memory is still 833.6 MB. Free memory was 373.8 MB in the beginning and 360.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 609]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && s__s3__tmp__next_state___0 <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && 8448 <= s__state) && 2 == blastFlag) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: ((((((((((!(8496 == s__state) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8673) && blastFlag == 0) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8672)) || (((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8673)) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag)) || (((((!(s__state == 8673) && s__state <= 8672) && blastFlag == 1) && s__hit == 0) && 8640 <= s__state) && !(s__state == 8672))) || (((((!(s__state == 8673) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(s__hit == 0)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8672 <= s__state) || ((s__hit == 0 && s__state == 8512) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__hit == 0) && s__state <= 8576) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (blastFlag == 1 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || (blastFlag == 0 && s__state == 8544)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (blastFlag == 0 && 8560 == s__state)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && s__hit == 0) && 2 == blastFlag)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || ((((s__state <= 8672 && blastFlag == 1) && !(s__state == 8657)) && s__hit == 0) && 8640 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag)) || (((blastFlag <= 3 && s__state <= 8672) && 8672 <= s__state) && !(s__hit == 0))) || ((s__hit == 0 && 8560 == s__state) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8608) && s__hit == 0) && 2 == blastFlag)) || (((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state)) || (2 == blastFlag && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(s__hit == 0))) || (blastFlag == 0 && s__state <= 3)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((s__state == 8528 && s__hit == 0) && 2 == blastFlag)) || ((s__hit == 0 && s__state == 8544) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481)) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && blastFlag == 1) && !(8448 == s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8448) && !(8448 == s__state))) || ((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && !(8448 == s__state)) && s__hit == 0) && 2 == blastFlag) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) && 2 == blastFlag) || (((((s__state <= 8672 && blastFlag == 1) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656))) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) && !(s__hit == 0))) || ((((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) && 2 == blastFlag) && !(s__hit == 0))) || (((((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) || (((((((((!(s__state == 8545) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8672 <= s__state) || ((s__hit == 0 && s__state == 8512) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__hit == 0) && s__state <= 8576) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (blastFlag == 1 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || (blastFlag == 0 && s__state == 8544)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (blastFlag == 0 && 8560 == s__state)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && s__hit == 0) && 2 == blastFlag)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || ((((s__state <= 8672 && blastFlag == 1) && !(s__state == 8657)) && s__hit == 0) && 8640 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag)) || (((blastFlag <= 3 && s__state <= 8672) && 8672 <= s__state) && !(s__hit == 0))) || ((s__hit == 0 && 8560 == s__state) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8608) && s__hit == 0) && 2 == blastFlag)) || (((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state)) || (2 == blastFlag && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(s__hit == 0))) || (blastFlag == 0 && s__state <= 3)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((s__state == 8528 && s__hit == 0) && 2 == blastFlag)) || ((s__hit == 0 && s__state == 8544) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && s__hit == 0) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: ((((((((((!(8496 == s__state) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && s__hit == 0) && 8448 <= s__state) && 2 == blastFlag) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && blastFlag == 1) && 8448 <= s__state)) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8448) && 8448 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && s__s3__tmp__next_state___0 <= 8640) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((((((((!(8496 == s__state) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && 8672 <= s__state) && !(12292 == s__state)) || (((blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state)) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8672 <= s__state) && !(12292 == s__state))) || ((blastFlag == 1 && 8672 <= s__state) && !(12292 == s__state)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && s__state == 8608) && s__hit == 0) && 2 == blastFlag) || (blastFlag == 0 && s__state == 8608)) || (blastFlag == 1 && s__state == 8608) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18.0s, OverallIterations: 35, TraceHistogramMax: 19, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6694 SDtfs, 4128 SDslu, 3183 SDs, 0 SdLazy, 3455 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1999 GetRequests, 1954 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4086occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 4500 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3347 HoareAnnotationTreeSize, 28 FomulaSimplifications, 155193 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 28 FomulaSimplificationsInter, 30432 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 9249 NumberOfCodeBlocks, 9249 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9209 ConstructedInterpolants, 0 QuantifiedInterpolants, 3966998 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3115 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 30536/30750 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...