/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_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:35:41,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:35:41,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:35:41,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:35:41,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:35:41,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:35:41,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:35:41,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:35:41,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:35:41,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:35:41,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:35:41,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:35:41,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:35:41,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:35:41,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:35:41,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:35:41,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:35:41,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:35:41,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:35:41,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:35:41,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:35:41,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:35:41,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:35:41,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:35:41,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:35:41,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:35:41,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:35:41,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:35:41,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:35:41,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:35:41,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:35:41,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:35:41,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:35:41,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:35:41,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:35:41,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:35:41,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:35:41,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:35:41,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:35:41,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:35:41,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:35:41,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:35:41,420 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:35:41,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:35:41,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:35:41,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:35:41,424 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:35:41,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:35:41,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:35:41,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:35:41,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:35:41,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:35:41,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:35:41,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:35:41,425 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:35:41,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:35:41,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:35:41,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:35:41,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:35:41,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:35:41,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:35:41,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:35:41,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:35:41,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:35:41,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:35:41,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:35:41,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:35:41,429 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 [2021-01-06 11:35:41,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:35:41,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:35:41,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:35:41,828 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:35:41,829 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:35:41,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-2.c [2021-01-06 11:35:41,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/06ee16604/cc4d1bf294c04eceb2ac62871bcea4f7/FLAGb4441ec81 [2021-01-06 11:35:42,570 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:35:42,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-2.c [2021-01-06 11:35:42,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/06ee16604/cc4d1bf294c04eceb2ac62871bcea4f7/FLAGb4441ec81 [2021-01-06 11:35:42,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/06ee16604/cc4d1bf294c04eceb2ac62871bcea4f7 [2021-01-06 11:35:42,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:35:42,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:35:42,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:42,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:35:42,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:35:42,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:42" (1/1) ... [2021-01-06 11:35:42,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d0498c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:42, skipping insertion in model container [2021-01-06 11:35:42,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:42" (1/1) ... [2021-01-06 11:35:42,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:35:42,993 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:35:43,221 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_2.cil-2.c[42399,42412] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2021-01-06 11:35:43,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:43,239 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:35:43,309 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_2.cil-2.c[42399,42412] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2021-01-06 11:35:43,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:43,340 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:35:43,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43 WrapperNode [2021-01-06 11:35:43,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:43,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:43,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:35:43,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:35:43,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:43,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:35:43,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:35:43,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:35:43,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (1/1) ... [2021-01-06 11:35:43,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:35:43,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:35:43,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:35:43,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:35:43,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (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 [2021-01-06 11:35:43,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:35:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:35:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:35:43,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:35:43,751 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:35:44,364 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-01-06 11:35:44,364 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-01-06 11:35:44,375 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:35:44,376 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:35:44,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:44 BoogieIcfgContainer [2021-01-06 11:35:44,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:35:44,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:35:44,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:35:44,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:35:44,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:35:42" (1/3) ... [2021-01-06 11:35:44,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642172ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:44, skipping insertion in model container [2021-01-06 11:35:44,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:43" (2/3) ... [2021-01-06 11:35:44,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642172ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:44, skipping insertion in model container [2021-01-06 11:35:44,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:44" (3/3) ... [2021-01-06 11:35:44,388 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-2.c [2021-01-06 11:35:44,394 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:35:44,401 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:35:44,422 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:35:44,453 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:35:44,453 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:35:44,453 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:35:44,453 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:35:44,454 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:35:44,454 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:35:44,454 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:35:44,454 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:35:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2021-01-06 11:35:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:35:44,484 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:44,485 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] [2021-01-06 11:35:44,486 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:44,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:44,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2021-01-06 11:35:44,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:44,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567077902] [2021-01-06 11:35:44,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:44,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567077902] [2021-01-06 11:35:44,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:44,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:44,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837303763] [2021-01-06 11:35:44,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:44,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:44,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:44,894 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2021-01-06 11:35:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:45,359 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-01-06 11:35:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:45,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 11:35:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:45,375 INFO L225 Difference]: With dead ends: 328 [2021-01-06 11:35:45,375 INFO L226 Difference]: Without dead ends: 175 [2021-01-06 11:35:45,379 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 [2021-01-06 11:35:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-01-06 11:35:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-01-06 11:35:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2021-01-06 11:35:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-01-06 11:35:45,437 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-01-06 11:35:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:45,437 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-01-06 11:35:45,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-01-06 11:35:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:35:45,441 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:45,441 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] [2021-01-06 11:35:45,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:35:45,441 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2021-01-06 11:35:45,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:45,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927962289] [2021-01-06 11:35:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:45,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927962289] [2021-01-06 11:35:45,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:45,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:45,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836403472] [2021-01-06 11:35:45,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:45,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:45,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:45,535 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand 3 states. [2021-01-06 11:35:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:45,737 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-01-06 11:35:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:45,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-01-06 11:35:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:45,740 INFO L225 Difference]: With dead ends: 380 [2021-01-06 11:35:45,740 INFO L226 Difference]: Without dead ends: 216 [2021-01-06 11:35:45,742 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 [2021-01-06 11:35:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-06 11:35:45,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-01-06 11:35:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2021-01-06 11:35:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-01-06 11:35:45,760 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-01-06 11:35:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:45,760 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-01-06 11:35:45,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-01-06 11:35:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 11:35:45,764 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:45,764 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] [2021-01-06 11:35:45,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:35:45,765 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:45,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:45,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2071968837, now seen corresponding path program 1 times [2021-01-06 11:35:45,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:45,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035930212] [2021-01-06 11:35:45,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:45,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035930212] [2021-01-06 11:35:45,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:45,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:45,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538567891] [2021-01-06 11:35:45,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:45,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:45,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:45,892 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand 3 states. [2021-01-06 11:35:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:46,071 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-01-06 11:35:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:46,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 11:35:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:46,074 INFO L225 Difference]: With dead ends: 445 [2021-01-06 11:35:46,074 INFO L226 Difference]: Without dead ends: 242 [2021-01-06 11:35:46,075 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 [2021-01-06 11:35:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-01-06 11:35:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-01-06 11:35:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 11:35:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-01-06 11:35:46,091 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-01-06 11:35:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:46,091 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-01-06 11:35:46,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-01-06 11:35:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:35:46,095 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:46,096 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] [2021-01-06 11:35:46,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:35:46,096 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash -947039589, now seen corresponding path program 1 times [2021-01-06 11:35:46,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:46,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240946125] [2021-01-06 11:35:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:46,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240946125] [2021-01-06 11:35:46,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:46,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:46,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873965552] [2021-01-06 11:35:46,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:46,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:46,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:46,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:46,159 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand 3 states. [2021-01-06 11:35:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:46,277 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-01-06 11:35:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:46,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2021-01-06 11:35:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:46,280 INFO L225 Difference]: With dead ends: 493 [2021-01-06 11:35:46,280 INFO L226 Difference]: Without dead ends: 259 [2021-01-06 11:35:46,281 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 [2021-01-06 11:35:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-06 11:35:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-01-06 11:35:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2021-01-06 11:35:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-01-06 11:35:46,294 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-01-06 11:35:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:46,294 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-01-06 11:35:46,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-01-06 11:35:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:35:46,297 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:46,297 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] [2021-01-06 11:35:46,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:35:46,298 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:46,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1168944985, now seen corresponding path program 1 times [2021-01-06 11:35:46,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:46,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183059528] [2021-01-06 11:35:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:46,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183059528] [2021-01-06 11:35:46,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:46,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:46,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183484825] [2021-01-06 11:35:46,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:46,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:46,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:46,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:46,366 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand 3 states. [2021-01-06 11:35:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:46,563 INFO L93 Difference]: Finished difference Result 552 states and 931 transitions. [2021-01-06 11:35:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:46,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2021-01-06 11:35:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:46,566 INFO L225 Difference]: With dead ends: 552 [2021-01-06 11:35:46,566 INFO L226 Difference]: Without dead ends: 303 [2021-01-06 11:35:46,567 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 [2021-01-06 11:35:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-01-06 11:35:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-01-06 11:35:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 11:35:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-01-06 11:35:46,578 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-01-06 11:35:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:46,579 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-01-06 11:35:46,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-01-06 11:35:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:35:46,580 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:46,581 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] [2021-01-06 11:35:46,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:35:46,581 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:46,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2129818626, now seen corresponding path program 1 times [2021-01-06 11:35:46,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:46,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577756017] [2021-01-06 11:35:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:46,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577756017] [2021-01-06 11:35:46,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:46,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:46,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283018960] [2021-01-06 11:35:46,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:46,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:46,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:46,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:46,637 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand 3 states. [2021-01-06 11:35:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:46,746 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-01-06 11:35:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:46,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:35:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:46,749 INFO L225 Difference]: With dead ends: 592 [2021-01-06 11:35:46,749 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:35:46,750 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 [2021-01-06 11:35:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:35:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-01-06 11:35:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 11:35:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-01-06 11:35:46,761 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-01-06 11:35:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:46,761 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-01-06 11:35:46,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-01-06 11:35:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:35:46,763 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:46,763 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] [2021-01-06 11:35:46,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:35:46,764 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:46,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:46,764 INFO L82 PathProgramCache]: Analyzing trace with hash -122958423, now seen corresponding path program 1 times [2021-01-06 11:35:46,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:46,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299825618] [2021-01-06 11:35:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:35:46,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299825618] [2021-01-06 11:35:46,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:46,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:46,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009016022] [2021-01-06 11:35:46,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:46,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:46,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:46,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:46,820 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand 3 states. [2021-01-06 11:35:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:47,007 INFO L93 Difference]: Finished difference Result 594 states and 995 transitions. [2021-01-06 11:35:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:47,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:35:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:47,010 INFO L225 Difference]: With dead ends: 594 [2021-01-06 11:35:47,010 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:35:47,011 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 [2021-01-06 11:35:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:35:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2021-01-06 11:35:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2021-01-06 11:35:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-01-06 11:35:47,038 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-01-06 11:35:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:47,042 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-01-06 11:35:47,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-01-06 11:35:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:35:47,044 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:47,044 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] [2021-01-06 11:35:47,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:35:47,045 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:47,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1553184093, now seen corresponding path program 1 times [2021-01-06 11:35:47,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:47,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127090467] [2021-01-06 11:35:47,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:35:47,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127090467] [2021-01-06 11:35:47,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:47,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:47,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732328397] [2021-01-06 11:35:47,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:47,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:47,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:47,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,117 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand 3 states. [2021-01-06 11:35:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:47,310 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-01-06 11:35:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:47,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-06 11:35:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:47,313 INFO L225 Difference]: With dead ends: 595 [2021-01-06 11:35:47,313 INFO L226 Difference]: Without dead ends: 306 [2021-01-06 11:35:47,314 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 [2021-01-06 11:35:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-01-06 11:35:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-01-06 11:35:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2021-01-06 11:35:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-01-06 11:35:47,326 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-01-06 11:35:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:47,326 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-01-06 11:35:47,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-01-06 11:35:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:35:47,327 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:47,328 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] [2021-01-06 11:35:47,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:35:47,328 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:47,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2083521026, now seen corresponding path program 1 times [2021-01-06 11:35:47,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:47,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63330384] [2021-01-06 11:35:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:47,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63330384] [2021-01-06 11:35:47,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:47,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:47,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801768004] [2021-01-06 11:35:47,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:47,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:47,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:47,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,380 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 3 states. [2021-01-06 11:35:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:47,558 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-01-06 11:35:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:47,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 11:35:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:47,560 INFO L225 Difference]: With dead ends: 635 [2021-01-06 11:35:47,561 INFO L226 Difference]: Without dead ends: 337 [2021-01-06 11:35:47,562 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 [2021-01-06 11:35:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-01-06 11:35:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-01-06 11:35:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2021-01-06 11:35:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-01-06 11:35:47,574 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-01-06 11:35:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:47,574 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-01-06 11:35:47,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-01-06 11:35:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:35:47,576 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:47,576 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] [2021-01-06 11:35:47,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:35:47,576 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:47,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:47,577 INFO L82 PathProgramCache]: Analyzing trace with hash -102460539, now seen corresponding path program 1 times [2021-01-06 11:35:47,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:47,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683282463] [2021-01-06 11:35:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:47,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683282463] [2021-01-06 11:35:47,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:47,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:47,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794072845] [2021-01-06 11:35:47,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:47,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:47,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:47,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,650 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 3 states. [2021-01-06 11:35:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:47,832 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-01-06 11:35:47,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:47,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 11:35:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:47,835 INFO L225 Difference]: With dead ends: 664 [2021-01-06 11:35:47,835 INFO L226 Difference]: Without dead ends: 337 [2021-01-06 11:35:47,836 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 [2021-01-06 11:35:47,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-01-06 11:35:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-01-06 11:35:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2021-01-06 11:35:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-01-06 11:35:47,850 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-01-06 11:35:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:47,850 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-01-06 11:35:47,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:47,850 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-01-06 11:35:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:35:47,852 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:47,852 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] [2021-01-06 11:35:47,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:35:47,852 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -651386898, now seen corresponding path program 1 times [2021-01-06 11:35:47,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:47,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167346229] [2021-01-06 11:35:47,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:47,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167346229] [2021-01-06 11:35:47,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:47,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:47,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807065795] [2021-01-06 11:35:47,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:47,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:47,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:47,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:47,904 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand 3 states. [2021-01-06 11:35:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:48,068 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-01-06 11:35:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:48,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 11:35:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:48,072 INFO L225 Difference]: With dead ends: 697 [2021-01-06 11:35:48,072 INFO L226 Difference]: Without dead ends: 370 [2021-01-06 11:35:48,073 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 [2021-01-06 11:35:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-01-06 11:35:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-01-06 11:35:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2021-01-06 11:35:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-01-06 11:35:48,088 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-01-06 11:35:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:48,088 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-01-06 11:35:48,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-01-06 11:35:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 11:35:48,090 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:48,090 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] [2021-01-06 11:35:48,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:35:48,091 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1258189035, now seen corresponding path program 1 times [2021-01-06 11:35:48,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:48,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395771619] [2021-01-06 11:35:48,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:35:48,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395771619] [2021-01-06 11:35:48,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:48,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:48,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044285003] [2021-01-06 11:35:48,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:48,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:48,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:48,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:48,135 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 3 states. [2021-01-06 11:35:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:48,319 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-01-06 11:35:48,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:48,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2021-01-06 11:35:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:48,321 INFO L225 Difference]: With dead ends: 724 [2021-01-06 11:35:48,321 INFO L226 Difference]: Without dead ends: 370 [2021-01-06 11:35:48,322 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 [2021-01-06 11:35:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-01-06 11:35:48,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-01-06 11:35:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2021-01-06 11:35:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-01-06 11:35:48,338 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-01-06 11:35:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:48,338 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-01-06 11:35:48,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-01-06 11:35:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:35:48,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:48,340 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] [2021-01-06 11:35:48,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:35:48,340 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:48,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1027805126, now seen corresponding path program 1 times [2021-01-06 11:35:48,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:48,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115561056] [2021-01-06 11:35:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:35:48,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115561056] [2021-01-06 11:35:48,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:48,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:48,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132996082] [2021-01-06 11:35:48,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:48,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:48,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:48,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:48,382 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 3 states. [2021-01-06 11:35:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:48,526 INFO L93 Difference]: Finished difference Result 742 states and 1195 transitions. [2021-01-06 11:35:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:48,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:35:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:48,529 INFO L225 Difference]: With dead ends: 742 [2021-01-06 11:35:48,529 INFO L226 Difference]: Without dead ends: 388 [2021-01-06 11:35:48,530 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 [2021-01-06 11:35:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-01-06 11:35:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2021-01-06 11:35:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-01-06 11:35:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-01-06 11:35:48,545 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-01-06 11:35:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:48,545 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-01-06 11:35:48,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-01-06 11:35:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:35:48,547 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:48,547 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] [2021-01-06 11:35:48,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:35:48,548 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:48,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:48,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1570072403, now seen corresponding path program 1 times [2021-01-06 11:35:48,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:48,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369494961] [2021-01-06 11:35:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:35:48,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369494961] [2021-01-06 11:35:48,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:48,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:48,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37737547] [2021-01-06 11:35:48,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:48,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:48,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:48,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:48,592 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 3 states. [2021-01-06 11:35:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:48,768 INFO L93 Difference]: Finished difference Result 763 states and 1218 transitions. [2021-01-06 11:35:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:48,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:35:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:48,772 INFO L225 Difference]: With dead ends: 763 [2021-01-06 11:35:48,772 INFO L226 Difference]: Without dead ends: 388 [2021-01-06 11:35:48,773 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 [2021-01-06 11:35:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-01-06 11:35:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2021-01-06 11:35:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-01-06 11:35:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-01-06 11:35:48,822 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-01-06 11:35:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:48,822 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-01-06 11:35:48,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-01-06 11:35:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:35:48,824 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:48,824 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] [2021-01-06 11:35:48,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:35:48,825 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1383340250, now seen corresponding path program 1 times [2021-01-06 11:35:48,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:48,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889372990] [2021-01-06 11:35:48,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:35:48,860 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:35:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:35:48,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:35:48,984 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:35:48,985 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:35:48,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:35:49,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:35:49 BoogieIcfgContainer [2021-01-06 11:35:49,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:35:49,107 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:35:49,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:35:49,108 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:35:49,108 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:44" (3/4) ... [2021-01-06 11:35:49,111 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 11:35:49,240 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_2.cil-2.c-witness.graphml [2021-01-06 11:35:49,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:35:49,243 INFO L168 Benchmark]: Toolchain (without parser) took 6326.92 ms. Allocated memory was 152.0 MB in the beginning and 221.2 MB in the end (delta: 69.2 MB). Free memory was 126.0 MB in the beginning and 154.3 MB in the end (delta: -28.2 MB). Peak memory consumption was 41.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:49,243 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 152.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:35:49,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.58 ms. Allocated memory is still 152.0 MB. Free memory was 125.7 MB in the beginning and 110.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:49,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.22 ms. Allocated memory is still 152.0 MB. Free memory was 110.6 MB in the beginning and 107.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:49,244 INFO L168 Benchmark]: Boogie Preprocessor took 48.94 ms. Allocated memory is still 152.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. [2021-01-06 11:35:49,245 INFO L168 Benchmark]: RCFGBuilder took 901.62 ms. Allocated memory is still 152.0 MB. Free memory was 105.5 MB in the beginning and 87.8 MB in the end (delta: 17.7 MB). Peak memory consumption was 19.0 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:49,245 INFO L168 Benchmark]: TraceAbstraction took 4726.89 ms. Allocated memory was 152.0 MB in the beginning and 221.2 MB in the end (delta: 69.2 MB). Free memory was 87.3 MB in the beginning and 168.9 MB in the end (delta: -81.6 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:35:49,246 INFO L168 Benchmark]: Witness Printer took 133.02 ms. Allocated memory is still 221.2 MB. Free memory was 168.9 MB in the beginning and 154.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:35:49,248 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.17 ms. Allocated memory is still 152.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 423.58 ms. Allocated memory is still 152.0 MB. Free memory was 125.7 MB in the beginning and 110.6 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 83.22 ms. Allocated memory is still 152.0 MB. Free memory was 110.6 MB in the beginning and 107.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 48.94 ms. Allocated memory is still 152.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 901.62 ms. Allocated memory is still 152.0 MB. Free memory was 105.5 MB in the beginning and 87.8 MB in the end (delta: 17.7 MB). Peak memory consumption was 19.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4726.89 ms. Allocated memory was 152.0 MB in the beginning and 221.2 MB in the end (delta: 69.2 MB). Free memory was 87.3 MB in the beginning and 168.9 MB in the end (delta: -81.6 MB). There was no memory consumed. Max. memory is 8.0 GB. * Witness Printer took 133.02 ms. Allocated memory is still 221.2 MB. Free memory was 168.9 MB in the beginning and 154.3 MB in the end (delta: 14.7 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: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L614] int s ; [L615] int tmp ; [L619] 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 ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp ; [L47] int cb ; [L48] long num1 = __VERIFIER_nondet_long() ; [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 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int tmp___10 = __VERIFIER_nondet_int() ; [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] tmp = __VERIFIER_nondet_int() [L78] Time = tmp [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] got_new_session = 0 [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback [L90] s__in_handshake ++ [L91] COND FALSE !(tmp___1 + 12288) [L96] COND FALSE !(s__cert == 0) [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND TRUE s__state == 8464 [L273] s__shutdown = 0 [L274] ret = __VERIFIER_nondet_int() [L275] COND TRUE blastFlag == 0 [L276] blastFlag = 1 [L278] COND FALSE !(ret <= 0) [L281] got_new_session = 1 [L282] s__state = 8496 [L283] s__init_num = 0 [L581] COND FALSE !(! s__s3__tmp__reuse_message) [L598] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND TRUE s__state == 8496 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L295] COND FALSE !(ret <= 0) [L298] COND TRUE \read(s__hit) [L299] s__state = 8656 [L303] s__init_num = 0 [L581] COND FALSE !(! s__s3__tmp__reuse_message) [L598] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND FALSE !(s__state == 8544) [L157] COND FALSE !(s__state == 8545) [L160] COND FALSE !(s__state == 8560) [L163] COND FALSE !(s__state == 8561) [L166] COND FALSE !(s__state == 8448) [L169] COND FALSE !(s__state == 8576) [L172] COND FALSE !(s__state == 8577) [L175] COND FALSE !(s__state == 8592) [L178] COND FALSE !(s__state == 8593) [L181] COND FALSE !(s__state == 8608) [L184] COND FALSE !(s__state == 8609) [L187] COND FALSE !(s__state == 8640) [L190] COND FALSE !(s__state == 8641) [L193] COND TRUE s__state == 8656 [L492] s__session__cipher = s__s3__tmp__new_cipher [L493] COND FALSE !(! tmp___9) [L497] ret = __VERIFIER_nondet_int() [L498] COND TRUE blastFlag == 2 [L499] blastFlag = 3 [L501] COND FALSE !(ret <= 0) [L504] s__state = 8672 [L505] s__init_num = 0 [L506] COND FALSE !(! tmp___10) [L581] COND FALSE !(! s__s3__tmp__reuse_message) [L598] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND FALSE !(s__state == 8544) [L157] COND FALSE !(s__state == 8545) [L160] COND FALSE !(s__state == 8560) [L163] COND FALSE !(s__state == 8561) [L166] COND FALSE !(s__state == 8448) [L169] COND FALSE !(s__state == 8576) [L172] COND FALSE !(s__state == 8577) [L175] COND FALSE !(s__state == 8592) [L178] COND FALSE !(s__state == 8593) [L181] COND FALSE !(s__state == 8608) [L184] COND FALSE !(s__state == 8609) [L187] COND FALSE !(s__state == 8640) [L190] COND FALSE !(s__state == 8641) [L193] COND FALSE !(s__state == 8656) [L196] COND FALSE !(s__state == 8657) [L199] COND TRUE s__state == 8672 [L513] ret = __VERIFIER_nondet_int() [L514] COND TRUE blastFlag == 3 [L609] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.5s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1835 SDtfs, 2038 SDslu, 248 SDs, 0 SdLazy, 1321 SolverSat, 599 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1191 ConstructedInterpolants, 0 QuantifiedInterpolants, 191664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 636/636 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...