/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_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:41:29,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:41:29,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:41:29,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:41:29,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:41:29,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:41:29,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:41:29,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:41:29,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:41:29,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:41:29,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:41:29,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:41:29,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:41:29,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:41:29,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:41:29,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:41:29,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:41:29,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:41:29,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:41:29,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:41:29,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:41:29,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:41:29,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:41:29,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:41:29,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:41:29,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:41:29,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:41:29,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:41:29,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:41:29,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:41:29,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:41:29,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:41:29,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:41:29,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:41:29,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:41:29,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:41:29,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:41:29,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:41:29,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:41:29,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:41:29,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:41:29,830 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:29,858 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:41:29,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:41:29,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:41:29,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:41:29,861 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:41:29,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:41:29,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:41:29,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:41:29,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:41:29,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:41:29,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:41:29,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:41:29,864 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:41:29,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:41:29,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:41:29,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:41:29,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:41:29,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:41:29,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:41:29,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:41:29,866 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:41:29,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:41:29,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:41:29,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:41:29,868 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:41:29,868 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:30,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:41:30,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:41:30,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:41:30,267 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:41:30,268 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:41:30,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-1.c [2020-12-23 01:41:30,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4da27e5a2/c5e8b636b0c54cca850e54dc3656e76b/FLAGb74cc6434 [2020-12-23 01:41:31,092 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:41:31,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-1.c [2020-12-23 01:41:31,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4da27e5a2/c5e8b636b0c54cca850e54dc3656e76b/FLAGb74cc6434 [2020-12-23 01:41:31,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4da27e5a2/c5e8b636b0c54cca850e54dc3656e76b [2020-12-23 01:41:31,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:41:31,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:41:31,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:31,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:41:31,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:41:31,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:31" (1/1) ... [2020-12-23 01:41:31,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297719a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31, skipping insertion in model container [2020-12-23 01:41:31,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:41:31" (1/1) ... [2020-12-23 01:41:31,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:41:31,496 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[~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[~tmp___3~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[~tmp___4~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[~tmp___5~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[~tmp___6~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[~num1~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[~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[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~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[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~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[~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:31,786 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_1.cil-1.c[42831,42844] 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:31,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:31,821 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[~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[~tmp___3~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[~tmp___4~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[~tmp___5~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[~tmp___6~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[~num1~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[~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[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~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[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~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[~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:31,890 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_1.cil-1.c[42831,42844] 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:31,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:41:31,911 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:41:31,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31 WrapperNode [2020-12-23 01:41:31,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:41:31,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:41:31,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:41:31,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:41:31,929 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:41:31" (1/1) ... [2020-12-23 01:41:31,941 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:41:31" (1/1) ... [2020-12-23 01:41:31,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:41:31,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:41:31,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:41:31,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:41:31,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31" (1/1) ... [2020-12-23 01:41:31,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31" (1/1) ... [2020-12-23 01:41:32,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31" (1/1) ... [2020-12-23 01:41:32,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31" (1/1) ... [2020-12-23 01:41:32,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31" (1/1) ... [2020-12-23 01:41:32,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31" (1/1) ... [2020-12-23 01:41:32,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31" (1/1) ... [2020-12-23 01:41:32,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:41:32,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:41:32,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:41:32,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:41:32,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31" (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:41:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:41:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:41:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:41:32,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:41:32,527 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:41:33,033 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-12-23 01:41:33,033 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-12-23 01:41:33,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:41:33,046 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:41:33,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:33 BoogieIcfgContainer [2020-12-23 01:41:33,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:41:33,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:41:33,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:41:33,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:41:33,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:41:31" (1/3) ... [2020-12-23 01:41:33,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf00dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:41:33, skipping insertion in model container [2020-12-23 01:41:33,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:41:31" (2/3) ... [2020-12-23 01:41:33,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf00dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:41:33, skipping insertion in model container [2020-12-23 01:41:33,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:33" (3/3) ... [2020-12-23 01:41:33,062 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-1.c [2020-12-23 01:41:33,069 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:41:33,074 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:41:33,094 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:41:33,124 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:41:33,125 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:41:33,125 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:41:33,125 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:41:33,125 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:41:33,125 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:41:33,126 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:41:33,126 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:41:33,146 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-12-23 01:41:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:41:33,158 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:33,159 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:41:33,160 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:33,166 INFO L82 PathProgramCache]: Analyzing trace with hash -947483198, now seen corresponding path program 1 times [2020-12-23 01:41:33,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:33,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623415258] [2020-12-23 01:41:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:33,479 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:41:33,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623415258] [2020-12-23 01:41:33,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:33,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:33,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842203875] [2020-12-23 01:41:33,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:33,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:33,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:33,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:33,505 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2020-12-23 01:41:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:33,907 INFO L93 Difference]: Finished difference Result 333 states and 570 transitions. [2020-12-23 01:41:33,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:33,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 01:41:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:33,942 INFO L225 Difference]: With dead ends: 333 [2020-12-23 01:41:33,942 INFO L226 Difference]: Without dead ends: 178 [2020-12-23 01:41:33,952 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:41:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-12-23 01:41:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2020-12-23 01:41:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-12-23 01:41:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 278 transitions. [2020-12-23 01:41:34,088 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 278 transitions. Word has length 45 [2020-12-23 01:41:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:34,089 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 278 transitions. [2020-12-23 01:41:34,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 278 transitions. [2020-12-23 01:41:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 01:41:34,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:34,092 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, 1] [2020-12-23 01:41:34,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:41:34,092 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash 472840096, now seen corresponding path program 1 times [2020-12-23 01:41:34,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:34,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138790486] [2020-12-23 01:41:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:34,185 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:41:34,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138790486] [2020-12-23 01:41:34,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:34,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:34,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445458626] [2020-12-23 01:41:34,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:34,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:34,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:34,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:34,189 INFO L87 Difference]: Start difference. First operand 172 states and 278 transitions. Second operand 3 states. [2020-12-23 01:41:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:34,433 INFO L93 Difference]: Finished difference Result 385 states and 632 transitions. [2020-12-23 01:41:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:34,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-23 01:41:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:34,438 INFO L225 Difference]: With dead ends: 385 [2020-12-23 01:41:34,438 INFO L226 Difference]: Without dead ends: 219 [2020-12-23 01:41:34,440 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:41:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-12-23 01:41:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2020-12-23 01:41:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-12-23 01:41:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 355 transitions. [2020-12-23 01:41:34,464 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 355 transitions. Word has length 46 [2020-12-23 01:41:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:34,464 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 355 transitions. [2020-12-23 01:41:34,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 355 transitions. [2020-12-23 01:41:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 01:41:34,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:34,471 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, 1, 1] [2020-12-23 01:41:34,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:41:34,471 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:34,472 INFO L82 PathProgramCache]: Analyzing trace with hash 488183924, now seen corresponding path program 1 times [2020-12-23 01:41:34,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:34,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507681282] [2020-12-23 01:41:34,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:34,587 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:41:34,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507681282] [2020-12-23 01:41:34,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:34,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:34,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968562206] [2020-12-23 01:41:34,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:34,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:34,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:34,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:34,590 INFO L87 Difference]: Start difference. First operand 213 states and 355 transitions. Second operand 3 states. [2020-12-23 01:41:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:34,820 INFO L93 Difference]: Finished difference Result 449 states and 756 transitions. [2020-12-23 01:41:34,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:34,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-12-23 01:41:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:34,824 INFO L225 Difference]: With dead ends: 449 [2020-12-23 01:41:34,824 INFO L226 Difference]: Without dead ends: 244 [2020-12-23 01:41:34,826 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:41:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-12-23 01:41:34,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2020-12-23 01:41:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-12-23 01:41:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 411 transitions. [2020-12-23 01:41:34,847 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 411 transitions. Word has length 74 [2020-12-23 01:41:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:34,848 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 411 transitions. [2020-12-23 01:41:34,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 411 transitions. [2020-12-23 01:41:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 01:41:34,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:34,858 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, 1] [2020-12-23 01:41:34,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:41:34,859 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:34,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:34,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1651483739, now seen corresponding path program 1 times [2020-12-23 01:41:34,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:34,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439869296] [2020-12-23 01:41:34,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:35,035 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:41:35,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439869296] [2020-12-23 01:41:35,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:35,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:35,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268364006] [2020-12-23 01:41:35,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:35,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:35,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:35,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:35,039 INFO L87 Difference]: Start difference. First operand 244 states and 411 transitions. Second operand 3 states. [2020-12-23 01:41:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:35,267 INFO L93 Difference]: Finished difference Result 526 states and 892 transitions. [2020-12-23 01:41:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:35,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-23 01:41:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:35,270 INFO L225 Difference]: With dead ends: 526 [2020-12-23 01:41:35,270 INFO L226 Difference]: Without dead ends: 290 [2020-12-23 01:41:35,272 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:41:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-12-23 01:41:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2020-12-23 01:41:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-12-23 01:41:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 486 transitions. [2020-12-23 01:41:35,291 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 486 transitions. Word has length 85 [2020-12-23 01:41:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:35,291 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 486 transitions. [2020-12-23 01:41:35,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 486 transitions. [2020-12-23 01:41:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 01:41:35,296 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:35,296 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, 1, 1] [2020-12-23 01:41:35,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:41:35,297 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1358393014, now seen corresponding path program 1 times [2020-12-23 01:41:35,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:35,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474461686] [2020-12-23 01:41:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:35,385 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:41:35,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474461686] [2020-12-23 01:41:35,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:35,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:35,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574690452] [2020-12-23 01:41:35,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:35,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:35,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:35,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:35,388 INFO L87 Difference]: Start difference. First operand 286 states and 486 transitions. Second operand 3 states. [2020-12-23 01:41:35,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:35,555 INFO L93 Difference]: Finished difference Result 581 states and 988 transitions. [2020-12-23 01:41:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:35,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 01:41:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:35,558 INFO L225 Difference]: With dead ends: 581 [2020-12-23 01:41:35,558 INFO L226 Difference]: Without dead ends: 303 [2020-12-23 01:41:35,559 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:41:35,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-12-23 01:41:35,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2020-12-23 01:41:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-12-23 01:41:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 508 transitions. [2020-12-23 01:41:35,575 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 508 transitions. Word has length 86 [2020-12-23 01:41:35,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:35,576 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 508 transitions. [2020-12-23 01:41:35,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 508 transitions. [2020-12-23 01:41:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 01:41:35,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:35,580 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, 1] [2020-12-23 01:41:35,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:41:35,580 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:35,581 INFO L82 PathProgramCache]: Analyzing trace with hash 709328611, now seen corresponding path program 1 times [2020-12-23 01:41:35,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:35,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204088597] [2020-12-23 01:41:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:35,647 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:41:35,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204088597] [2020-12-23 01:41:35,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:35,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:35,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587548942] [2020-12-23 01:41:35,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:35,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:35,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:35,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:35,650 INFO L87 Difference]: Start difference. First operand 301 states and 508 transitions. Second operand 3 states. [2020-12-23 01:41:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:35,853 INFO L93 Difference]: Finished difference Result 598 states and 1009 transitions. [2020-12-23 01:41:35,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:35,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 01:41:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:35,856 INFO L225 Difference]: With dead ends: 598 [2020-12-23 01:41:35,856 INFO L226 Difference]: Without dead ends: 303 [2020-12-23 01:41:35,857 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:41:35,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-12-23 01:41:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-12-23 01:41:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-23 01:41:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 503 transitions. [2020-12-23 01:41:35,869 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 503 transitions. Word has length 86 [2020-12-23 01:41:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:35,870 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 503 transitions. [2020-12-23 01:41:35,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 503 transitions. [2020-12-23 01:41:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 01:41:35,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:35,872 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, 1, 1] [2020-12-23 01:41:35,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:41:35,873 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:35,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash 564851953, now seen corresponding path program 1 times [2020-12-23 01:41:35,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:35,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54777401] [2020-12-23 01:41:35,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:35,939 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:41:35,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54777401] [2020-12-23 01:41:35,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:35,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:35,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059766702] [2020-12-23 01:41:35,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:35,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:35,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:35,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:35,947 INFO L87 Difference]: Start difference. First operand 299 states and 503 transitions. Second operand 3 states. [2020-12-23 01:41:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:36,093 INFO L93 Difference]: Finished difference Result 592 states and 996 transitions. [2020-12-23 01:41:36,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:36,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-23 01:41:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:36,096 INFO L225 Difference]: With dead ends: 592 [2020-12-23 01:41:36,096 INFO L226 Difference]: Without dead ends: 301 [2020-12-23 01:41:36,097 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:41:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-12-23 01:41:36,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2020-12-23 01:41:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-23 01:41:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 499 transitions. [2020-12-23 01:41:36,119 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 499 transitions. Word has length 87 [2020-12-23 01:41:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:36,120 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 499 transitions. [2020-12-23 01:41:36,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 499 transitions. [2020-12-23 01:41:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:41:36,121 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:36,122 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, 1, 1, 1] [2020-12-23 01:41:36,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:41:36,122 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:36,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:36,123 INFO L82 PathProgramCache]: Analyzing trace with hash 19025617, now seen corresponding path program 1 times [2020-12-23 01:41:36,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:36,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063509259] [2020-12-23 01:41:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:36,167 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:41:36,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063509259] [2020-12-23 01:41:36,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:36,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:36,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813031572] [2020-12-23 01:41:36,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:36,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:36,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:36,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:36,170 INFO L87 Difference]: Start difference. First operand 299 states and 499 transitions. Second operand 3 states. [2020-12-23 01:41:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:36,299 INFO L93 Difference]: Finished difference Result 599 states and 998 transitions. [2020-12-23 01:41:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:36,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 01:41:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:36,302 INFO L225 Difference]: With dead ends: 599 [2020-12-23 01:41:36,302 INFO L226 Difference]: Without dead ends: 308 [2020-12-23 01:41:36,303 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:41:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2020-12-23 01:41:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2020-12-23 01:41:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-12-23 01:41:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 505 transitions. [2020-12-23 01:41:36,316 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 505 transitions. Word has length 100 [2020-12-23 01:41:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:36,316 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 505 transitions. [2020-12-23 01:41:36,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 505 transitions. [2020-12-23 01:41:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:41:36,318 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:36,318 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, 1, 1] [2020-12-23 01:41:36,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:41:36,319 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1778247501, now seen corresponding path program 1 times [2020-12-23 01:41:36,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:36,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194952155] [2020-12-23 01:41:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:36,365 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:41:36,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194952155] [2020-12-23 01:41:36,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:36,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:36,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798962079] [2020-12-23 01:41:36,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:36,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:36,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:36,368 INFO L87 Difference]: Start difference. First operand 308 states and 505 transitions. Second operand 3 states. [2020-12-23 01:41:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:36,529 INFO L93 Difference]: Finished difference Result 639 states and 1051 transitions. [2020-12-23 01:41:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:36,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 01:41:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:36,532 INFO L225 Difference]: With dead ends: 639 [2020-12-23 01:41:36,532 INFO L226 Difference]: Without dead ends: 339 [2020-12-23 01:41:36,533 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:41:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-12-23 01:41:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2020-12-23 01:41:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-12-23 01:41:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 552 transitions. [2020-12-23 01:41:36,546 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 552 transitions. Word has length 100 [2020-12-23 01:41:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:36,546 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 552 transitions. [2020-12-23 01:41:36,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 552 transitions. [2020-12-23 01:41:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:41:36,548 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:36,548 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, 1, 1] [2020-12-23 01:41:36,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:41:36,549 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:36,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:36,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1388103916, now seen corresponding path program 1 times [2020-12-23 01:41:36,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:36,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177754468] [2020-12-23 01:41:36,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:36,603 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:41:36,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177754468] [2020-12-23 01:41:36,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:36,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:36,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501288904] [2020-12-23 01:41:36,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:36,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:36,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:36,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:36,606 INFO L87 Difference]: Start difference. First operand 337 states and 552 transitions. Second operand 3 states. [2020-12-23 01:41:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:36,796 INFO L93 Difference]: Finished difference Result 668 states and 1094 transitions. [2020-12-23 01:41:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:36,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-23 01:41:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:36,799 INFO L225 Difference]: With dead ends: 668 [2020-12-23 01:41:36,799 INFO L226 Difference]: Without dead ends: 339 [2020-12-23 01:41:36,800 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:41:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-12-23 01:41:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2020-12-23 01:41:36,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-12-23 01:41:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 548 transitions. [2020-12-23 01:41:36,821 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 548 transitions. Word has length 101 [2020-12-23 01:41:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:36,822 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 548 transitions. [2020-12-23 01:41:36,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 548 transitions. [2020-12-23 01:41:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:41:36,824 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:36,825 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, 1, 1] [2020-12-23 01:41:36,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:41:36,825 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:36,826 INFO L82 PathProgramCache]: Analyzing trace with hash -916073731, now seen corresponding path program 1 times [2020-12-23 01:41:36,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:36,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859327493] [2020-12-23 01:41:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:36,886 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:41:36,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859327493] [2020-12-23 01:41:36,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:36,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:36,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607188747] [2020-12-23 01:41:36,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:36,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:36,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:36,889 INFO L87 Difference]: Start difference. First operand 337 states and 548 transitions. Second operand 3 states. [2020-12-23 01:41:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:37,116 INFO L93 Difference]: Finished difference Result 701 states and 1144 transitions. [2020-12-23 01:41:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:37,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-12-23 01:41:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:37,120 INFO L225 Difference]: With dead ends: 701 [2020-12-23 01:41:37,120 INFO L226 Difference]: Without dead ends: 372 [2020-12-23 01:41:37,122 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:41:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-12-23 01:41:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2020-12-23 01:41:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-12-23 01:41:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 590 transitions. [2020-12-23 01:41:37,145 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 590 transitions. Word has length 102 [2020-12-23 01:41:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:37,146 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 590 transitions. [2020-12-23 01:41:37,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 590 transitions. [2020-12-23 01:41:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 01:41:37,149 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:37,149 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, 1, 1] [2020-12-23 01:41:37,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:41:37,150 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:37,151 INFO L82 PathProgramCache]: Analyzing trace with hash 62624868, now seen corresponding path program 1 times [2020-12-23 01:41:37,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:37,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241868918] [2020-12-23 01:41:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:37,196 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:41:37,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241868918] [2020-12-23 01:41:37,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:37,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:37,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311912874] [2020-12-23 01:41:37,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:37,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:37,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:37,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:37,198 INFO L87 Difference]: Start difference. First operand 364 states and 590 transitions. Second operand 3 states. [2020-12-23 01:41:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:37,417 INFO L93 Difference]: Finished difference Result 728 states and 1181 transitions. [2020-12-23 01:41:37,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:37,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-12-23 01:41:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:37,420 INFO L225 Difference]: With dead ends: 728 [2020-12-23 01:41:37,420 INFO L226 Difference]: Without dead ends: 372 [2020-12-23 01:41:37,421 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:41:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-12-23 01:41:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2020-12-23 01:41:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-12-23 01:41:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 585 transitions. [2020-12-23 01:41:37,440 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 585 transitions. Word has length 103 [2020-12-23 01:41:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:37,440 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 585 transitions. [2020-12-23 01:41:37,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 585 transitions. [2020-12-23 01:41:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:41:37,443 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:37,443 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, 1] [2020-12-23 01:41:37,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:41:37,443 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1773852357, now seen corresponding path program 1 times [2020-12-23 01:41:37,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:37,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173595457] [2020-12-23 01:41:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:37,489 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:41:37,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173595457] [2020-12-23 01:41:37,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:37,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:37,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870857089] [2020-12-23 01:41:37,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:37,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:37,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:37,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:37,492 INFO L87 Difference]: Start difference. First operand 364 states and 585 transitions. Second operand 3 states. [2020-12-23 01:41:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:37,654 INFO L93 Difference]: Finished difference Result 745 states and 1199 transitions. [2020-12-23 01:41:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:37,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:41:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:37,657 INFO L225 Difference]: With dead ends: 745 [2020-12-23 01:41:37,657 INFO L226 Difference]: Without dead ends: 389 [2020-12-23 01:41:37,658 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:41:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2020-12-23 01:41:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2020-12-23 01:41:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-12-23 01:41:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 614 transitions. [2020-12-23 01:41:37,675 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 614 transitions. Word has length 106 [2020-12-23 01:41:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:37,675 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 614 transitions. [2020-12-23 01:41:37,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 614 transitions. [2020-12-23 01:41:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 01:41:37,677 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:37,677 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, 1] [2020-12-23 01:41:37,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:41:37,678 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:37,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1450939714, now seen corresponding path program 1 times [2020-12-23 01:41:37,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:37,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567920060] [2020-12-23 01:41:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:37,722 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:41:37,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567920060] [2020-12-23 01:41:37,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:37,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:37,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12829452] [2020-12-23 01:41:37,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:37,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:37,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:37,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:37,725 INFO L87 Difference]: Start difference. First operand 385 states and 614 transitions. Second operand 3 states. [2020-12-23 01:41:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:37,881 INFO L93 Difference]: Finished difference Result 766 states and 1222 transitions. [2020-12-23 01:41:37,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:37,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-23 01:41:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:37,885 INFO L225 Difference]: With dead ends: 766 [2020-12-23 01:41:37,885 INFO L226 Difference]: Without dead ends: 389 [2020-12-23 01:41:37,886 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:41:37,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2020-12-23 01:41:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2020-12-23 01:41:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-12-23 01:41:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 608 transitions. [2020-12-23 01:41:37,902 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 608 transitions. Word has length 107 [2020-12-23 01:41:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:37,903 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 608 transitions. [2020-12-23 01:41:37,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 608 transitions. [2020-12-23 01:41:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 01:41:37,914 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:37,914 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:41:37,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:41:37,915 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1044207465, now seen corresponding path program 1 times [2020-12-23 01:41:37,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:37,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816062489] [2020-12-23 01:41:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:41:37,968 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:41:37,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816062489] [2020-12-23 01:41:37,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:41:37,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:41:37,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586881100] [2020-12-23 01:41:37,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:41:37,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:41:37,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:41:37,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:41:37,971 INFO L87 Difference]: Start difference. First operand 385 states and 608 transitions. Second operand 3 states. [2020-12-23 01:41:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:41:38,032 INFO L93 Difference]: Finished difference Result 1093 states and 1730 transitions. [2020-12-23 01:41:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:41:38,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-12-23 01:41:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:41:38,037 INFO L225 Difference]: With dead ends: 1093 [2020-12-23 01:41:38,037 INFO L226 Difference]: Without dead ends: 716 [2020-12-23 01:41:38,038 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:41:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-23 01:41:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2020-12-23 01:41:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-23 01:41:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1128 transitions. [2020-12-23 01:41:38,070 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1128 transitions. Word has length 122 [2020-12-23 01:41:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:41:38,070 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 1128 transitions. [2020-12-23 01:41:38,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:41:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1128 transitions. [2020-12-23 01:41:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 01:41:38,073 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:41:38,073 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:41:38,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:41:38,073 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:41:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:41:38,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1005180377, now seen corresponding path program 1 times [2020-12-23 01:41:38,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:41:38,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173961999] [2020-12-23 01:41:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:41:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:41:38,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:41:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:41:38,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:41:38,284 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:41:38,286 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:41:38,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:41:38,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:41:38 BoogieIcfgContainer [2020-12-23 01:41:38,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:41:38,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:41:38,452 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:41:38,452 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:41:38,452 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:41:33" (3/4) ... [2020-12-23 01:41:38,456 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 01:41:38,578 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_1.cil-1.c-witness.graphml [2020-12-23 01:41:38,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:41:38,586 INFO L168 Benchmark]: Toolchain (without parser) took 7169.31 ms. Allocated memory was 151.0 MB in the beginning and 235.9 MB in the end (delta: 84.9 MB). Free memory was 126.1 MB in the beginning and 123.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 88.9 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:38,586 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.6 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:41:38,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.81 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 110.8 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:38,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.32 ms. Allocated memory is still 151.0 MB. Free memory was 110.8 MB in the beginning and 107.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:38,587 INFO L168 Benchmark]: Boogie Preprocessor took 60.61 ms. Allocated memory is still 151.0 MB. Free memory was 107.8 MB in the beginning and 105.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:41:38,588 INFO L168 Benchmark]: RCFGBuilder took 1001.20 ms. Allocated memory is still 151.0 MB. Free memory was 105.7 MB in the beginning and 86.4 MB in the end (delta: 19.3 MB). Peak memory consumption was 18.8 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:38,588 INFO L168 Benchmark]: TraceAbstraction took 5400.43 ms. Allocated memory was 151.0 MB in the beginning and 235.9 MB in the end (delta: 84.9 MB). Free memory was 85.8 MB in the beginning and 137.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 33.4 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:38,589 INFO L168 Benchmark]: Witness Printer took 126.86 ms. Allocated memory is still 235.9 MB. Free memory was 137.9 MB in the beginning and 123.6 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:41:38,593 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.19 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.6 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 500.81 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 110.8 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 66.32 ms. Allocated memory is still 151.0 MB. Free memory was 110.8 MB in the beginning and 107.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 60.61 ms. Allocated memory is still 151.0 MB. Free memory was 107.8 MB in the beginning and 105.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1001.20 ms. Allocated memory is still 151.0 MB. Free memory was 105.7 MB in the beginning and 86.4 MB in the end (delta: 19.3 MB). Peak memory consumption was 18.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5400.43 ms. Allocated memory was 151.0 MB in the beginning and 235.9 MB in the end (delta: 84.9 MB). Free memory was 85.8 MB in the beginning and 137.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 33.4 MB. Max. memory is 8.0 GB. * Witness Printer took 126.86 ms. Allocated memory is still 235.9 MB. Free memory was 137.9 MB in the beginning and 123.6 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 613]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L618] int s ; [L619] int tmp ; [L623] s = 8464 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 = 1; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__cert = __VERIFIER_nondet_int() ; [L27] int s__options = __VERIFIER_nondet_int() ; [L28] int s__verify_mode = __VERIFIER_nondet_int() ; [L29] int s__session__peer = __VERIFIER_nondet_int() ; [L30] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L31] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__cert_request ; [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__use_rsa_tmp ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L42] int s__session__cipher ; [L43] int buf = __VERIFIER_nondet_int() ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp = __VERIFIER_nondet_long() ; [L47] int cb ; [L48] long num1 ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int got_new_session ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 ; [L57] int tmp___4 ; [L58] int tmp___5 ; [L59] int tmp___6 ; [L60] int tmp___7 ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 ; [L63] int tmp___10 ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] unsigned long __cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 ; [L69] unsigned long __cil_tmp59 ; [L70] int __cil_tmp60 ; [L71] unsigned long __cil_tmp61 ; [L75] s__state = initial_state [L76] blastFlag = 0 [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND FALSE !(tmp___1 + 12288) [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L270] s__shutdown = 0 [L271] ret = __VERIFIER_nondet_int() [L272] COND TRUE blastFlag == 0 [L273] blastFlag = 1 [L275] COND FALSE !(ret <= 0) [L278] got_new_session = 1 [L279] s__state = 8496 [L280] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L602] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L288] COND FALSE !(ret <= 0) [L291] COND TRUE \read(s__hit) [L292] s__state = 8656 [L296] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L602] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND FALSE !(s__state == 8448) [L168] COND FALSE !(s__state == 8576) [L171] COND FALSE !(s__state == 8577) [L174] COND FALSE !(s__state == 8592) [L177] COND FALSE !(s__state == 8593) [L180] COND FALSE !(s__state == 8608) [L183] COND FALSE !(s__state == 8609) [L186] COND FALSE !(s__state == 8640) [L189] COND FALSE !(s__state == 8641) [L192] COND TRUE s__state == 8656 [L490] s__session__cipher = s__s3__tmp__new_cipher [L491] tmp___9 = __VERIFIER_nondet_int() [L492] COND FALSE !(! tmp___9) [L496] ret = __VERIFIER_nondet_int() [L497] COND TRUE blastFlag == 2 [L498] blastFlag = 3 [L500] COND FALSE !(ret <= 0) [L503] s__state = 8672 [L504] s__init_num = 0 [L505] tmp___10 = __VERIFIER_nondet_int() [L506] COND FALSE !(! tmp___10) [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L602] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND FALSE !(s__state == 8448) [L168] COND FALSE !(s__state == 8576) [L171] COND FALSE !(s__state == 8577) [L174] COND FALSE !(s__state == 8592) [L177] COND FALSE !(s__state == 8593) [L180] COND FALSE !(s__state == 8608) [L183] COND FALSE !(s__state == 8609) [L186] COND FALSE !(s__state == 8640) [L189] COND FALSE !(s__state == 8641) [L192] COND FALSE !(s__state == 8656) [L195] COND FALSE !(s__state == 8657) [L198] COND TRUE s__state == 8672 [L513] ret = __VERIFIER_nondet_int() [L514] COND FALSE !(blastFlag == 4) [L517] COND TRUE blastFlag == 3 [L613] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.1s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2225 SDtfs, 2216 SDslu, 435 SDs, 0 SdLazy, 1340 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=716occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1472 NumberOfCodeBlocks, 1472 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1335 ConstructedInterpolants, 0 QuantifiedInterpolants, 221866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 736/736 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 incorrect! Received shutdown request...