/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:35:47,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:35:47,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:35:47,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:35:47,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:35:47,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:35:47,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:35:47,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:35:47,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:35:47,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:35:47,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:35:47,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:35:47,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:35:47,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:35:47,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:35:47,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:35:47,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:35:47,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:35:47,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:35:47,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:35:47,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:35:47,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:35:47,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:35:47,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:35:47,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:35:47,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:35:47,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:35:47,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:35:47,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:35:47,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:35:47,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:35:47,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:35:47,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:35:47,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:35:47,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:35:47,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:35:47,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:35:47,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:35:47,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:35:47,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:35:47,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:35:47,919 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:47,973 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:35:47,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:35:47,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:35:47,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:35:47,977 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:35:47,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:35:47,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:35:47,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:35:47,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:35:47,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:35:47,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:35:47,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:35:47,982 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:35:47,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:35:47,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:35:47,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:35:47,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:35:47,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:35:47,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:35:47,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:35:47,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:35:47,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:35:47,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:35:47,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:35:47,985 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:35:47,985 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:48,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:35:48,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:35:48,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:35:48,487 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:35:48,489 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:35:48,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2021-01-06 11:35:48,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c41680534/f89577bcc4654a5fb1e7c2f6b7b77a02/FLAG4e18a2f09 [2021-01-06 11:35:49,368 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:35:49,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2021-01-06 11:35:49,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c41680534/f89577bcc4654a5fb1e7c2f6b7b77a02/FLAG4e18a2f09 [2021-01-06 11:35:49,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c41680534/f89577bcc4654a5fb1e7c2f6b7b77a02 [2021-01-06 11:35:49,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:35:49,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:35:49,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:49,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:35:49,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:35:49,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:49" (1/1) ... [2021-01-06 11:35:49,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16938a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:49, skipping insertion in model container [2021-01-06 11:35:49,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:49" (1/1) ... [2021-01-06 11:35:49,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:35:49,694 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:35:49,946 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42370,42383] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2021-01-06 11:35:49,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:49,971 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp55~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp56~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp57~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp58~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp59~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp60~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp61~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:35:50,125 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42370,42383] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2021-01-06 11:35:50,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:35:50,157 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:35:50,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:50 WrapperNode [2021-01-06 11:35:50,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:35:50,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:50,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:35:50,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:35:50,176 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:50" (1/1) ... [2021-01-06 11:35:50,210 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:50" (1/1) ... [2021-01-06 11:35:50,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:35:50,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:35:50,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:35:50,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:35:50,305 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:50" (1/1) ... [2021-01-06 11:35:50,305 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:50" (1/1) ... [2021-01-06 11:35:50,309 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:50" (1/1) ... [2021-01-06 11:35:50,309 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:50" (1/1) ... [2021-01-06 11:35:50,318 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:50" (1/1) ... [2021-01-06 11:35:50,327 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:50" (1/1) ... [2021-01-06 11:35:50,331 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:50" (1/1) ... [2021-01-06 11:35:50,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:35:50,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:35:50,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:35:50,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:35:50,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:50" (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:50,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:35:50,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:35:50,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:35:50,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:35:50,763 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:35:51,398 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-01-06 11:35:51,398 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-01-06 11:35:51,409 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:35:51,410 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:35:51,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:51 BoogieIcfgContainer [2021-01-06 11:35:51,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:35:51,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:35:51,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:35:51,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:35:51,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:35:49" (1/3) ... [2021-01-06 11:35:51,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ead28c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:51, skipping insertion in model container [2021-01-06 11:35:51,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:50" (2/3) ... [2021-01-06 11:35:51,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ead28c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:51, skipping insertion in model container [2021-01-06 11:35:51,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:51" (3/3) ... [2021-01-06 11:35:51,421 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2021-01-06 11:35:51,428 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:35:51,434 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:35:51,454 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:35:51,484 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:35:51,484 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:35:51,484 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:35:51,484 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:35:51,485 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:35:51,485 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:35:51,485 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:35:51,485 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:35:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2021-01-06 11:35:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:35:51,519 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:51,521 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:51,521 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:51,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2021-01-06 11:35:51,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:51,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804928655] [2021-01-06 11:35:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:51,850 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:51,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804928655] [2021-01-06 11:35:51,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:51,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:51,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053753939] [2021-01-06 11:35:51,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:51,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:51,879 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2021-01-06 11:35:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:52,236 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-01-06 11:35:52,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:52,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 11:35:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:52,253 INFO L225 Difference]: With dead ends: 328 [2021-01-06 11:35:52,253 INFO L226 Difference]: Without dead ends: 175 [2021-01-06 11:35:52,257 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:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-01-06 11:35:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-01-06 11:35:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2021-01-06 11:35:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-01-06 11:35:52,318 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-01-06 11:35:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:52,318 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-01-06 11:35:52,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-01-06 11:35:52,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:35:52,322 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:52,322 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:52,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:35:52,323 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:52,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:52,324 INFO L82 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2021-01-06 11:35:52,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:52,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358206958] [2021-01-06 11:35:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:52,471 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:52,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358206958] [2021-01-06 11:35:52,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:52,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:52,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479865664] [2021-01-06 11:35:52,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:52,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:52,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:52,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:52,477 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand 3 states. [2021-01-06 11:35:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:52,723 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-01-06 11:35:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:52,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-01-06 11:35:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:52,727 INFO L225 Difference]: With dead ends: 380 [2021-01-06 11:35:52,727 INFO L226 Difference]: Without dead ends: 216 [2021-01-06 11:35:52,729 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:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-06 11:35:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-01-06 11:35:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2021-01-06 11:35:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-01-06 11:35:52,752 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-01-06 11:35:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:52,752 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-01-06 11:35:52,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-01-06 11:35:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 11:35:52,756 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:52,756 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:52,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:35:52,757 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:52,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1754997851, now seen corresponding path program 1 times [2021-01-06 11:35:52,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:52,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605281715] [2021-01-06 11:35:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:52,886 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:52,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605281715] [2021-01-06 11:35:52,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:52,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:52,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544613211] [2021-01-06 11:35:52,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:52,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:52,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:52,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:52,890 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand 3 states. [2021-01-06 11:35:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:53,152 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-01-06 11:35:53,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:53,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 11:35:53,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:53,158 INFO L225 Difference]: With dead ends: 445 [2021-01-06 11:35:53,159 INFO L226 Difference]: Without dead ends: 242 [2021-01-06 11:35:53,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-01-06 11:35:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-01-06 11:35:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 11:35:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-01-06 11:35:53,216 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-01-06 11:35:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:53,216 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-01-06 11:35:53,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-01-06 11:35:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:35:53,226 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:53,228 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:53,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:35:53,229 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash -479038981, now seen corresponding path program 1 times [2021-01-06 11:35:53,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:53,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816292531] [2021-01-06 11:35:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:53,384 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:53,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816292531] [2021-01-06 11:35:53,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:53,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:53,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755240914] [2021-01-06 11:35:53,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:53,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:53,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:53,392 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand 3 states. [2021-01-06 11:35:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:53,570 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-01-06 11:35:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:53,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2021-01-06 11:35:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:53,573 INFO L225 Difference]: With dead ends: 493 [2021-01-06 11:35:53,573 INFO L226 Difference]: Without dead ends: 259 [2021-01-06 11:35:53,574 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:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-06 11:35:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-01-06 11:35:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2021-01-06 11:35:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-01-06 11:35:53,592 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-01-06 11:35:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:53,592 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-01-06 11:35:53,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-01-06 11:35:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:35:53,595 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:53,595 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:53,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:35:53,596 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1816808322, now seen corresponding path program 1 times [2021-01-06 11:35:53,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:53,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922438641] [2021-01-06 11:35:53,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:53,697 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:53,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922438641] [2021-01-06 11:35:53,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:53,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:53,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054748927] [2021-01-06 11:35:53,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:53,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:53,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:53,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:53,703 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand 3 states. [2021-01-06 11:35:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:53,933 INFO L93 Difference]: Finished difference Result 553 states and 933 transitions. [2021-01-06 11:35:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:53,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2021-01-06 11:35:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:53,937 INFO L225 Difference]: With dead ends: 553 [2021-01-06 11:35:53,937 INFO L226 Difference]: Without dead ends: 304 [2021-01-06 11:35:53,938 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:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-01-06 11:35:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2021-01-06 11:35:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 11:35:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-01-06 11:35:53,957 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-01-06 11:35:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:53,957 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-01-06 11:35:53,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-01-06 11:35:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:35:53,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:53,961 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:53,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:35:53,962 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:53,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1697148062, now seen corresponding path program 1 times [2021-01-06 11:35:53,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:53,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720854852] [2021-01-06 11:35:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:54,022 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:54,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720854852] [2021-01-06 11:35:54,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:54,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:54,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805965746] [2021-01-06 11:35:54,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:54,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:54,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:54,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:54,025 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand 3 states. [2021-01-06 11:35:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:54,219 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-01-06 11:35:54,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:54,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:35:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:54,222 INFO L225 Difference]: With dead ends: 592 [2021-01-06 11:35:54,222 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 11:35:54,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 11:35:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-01-06 11:35:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 11:35:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-01-06 11:35:54,244 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-01-06 11:35:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:54,245 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-01-06 11:35:54,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-01-06 11:35:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:35:54,248 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:54,249 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:54,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:35:54,255 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:54,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:54,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1432172412, now seen corresponding path program 1 times [2021-01-06 11:35:54,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:54,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915966724] [2021-01-06 11:35:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:54,390 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:54,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915966724] [2021-01-06 11:35:54,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:54,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:54,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386462615] [2021-01-06 11:35:54,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:54,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:54,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:54,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:54,398 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand 3 states. [2021-01-06 11:35:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:54,600 INFO L93 Difference]: Finished difference Result 595 states and 997 transitions. [2021-01-06 11:35:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:54,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:35:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:54,603 INFO L225 Difference]: With dead ends: 595 [2021-01-06 11:35:54,603 INFO L226 Difference]: Without dead ends: 302 [2021-01-06 11:35:54,605 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:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-01-06 11:35:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2021-01-06 11:35:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2021-01-06 11:35:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-01-06 11:35:54,618 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-01-06 11:35:54,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:54,619 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-01-06 11:35:54,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-01-06 11:35:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 11:35:54,622 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:54,622 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:54,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:35:54,622 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:54,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:54,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1085183485, now seen corresponding path program 1 times [2021-01-06 11:35:54,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:54,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955492976] [2021-01-06 11:35:54,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:54,721 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:54,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955492976] [2021-01-06 11:35:54,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:54,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:54,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257884550] [2021-01-06 11:35:54,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:54,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:54,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:54,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:54,727 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand 3 states. [2021-01-06 11:35:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:54,871 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-01-06 11:35:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:54,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-06 11:35:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:54,873 INFO L225 Difference]: With dead ends: 595 [2021-01-06 11:35:54,874 INFO L226 Difference]: Without dead ends: 306 [2021-01-06 11:35:54,875 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:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-01-06 11:35:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-01-06 11:35:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2021-01-06 11:35:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-01-06 11:35:54,891 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-01-06 11:35:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:54,891 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-01-06 11:35:54,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-01-06 11:35:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:35:54,893 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:54,893 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:54,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:35:54,894 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:54,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:54,895 INFO L82 PathProgramCache]: Analyzing trace with hash -860132162, now seen corresponding path program 1 times [2021-01-06 11:35:54,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:54,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611966294] [2021-01-06 11:35:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:54,985 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:54,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611966294] [2021-01-06 11:35:54,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:54,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:54,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548377298] [2021-01-06 11:35:54,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:54,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:54,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:54,992 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 3 states. [2021-01-06 11:35:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:55,167 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-01-06 11:35:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:55,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 11:35:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:55,172 INFO L225 Difference]: With dead ends: 635 [2021-01-06 11:35:55,172 INFO L226 Difference]: Without dead ends: 337 [2021-01-06 11:35:55,173 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:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-01-06 11:35:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-01-06 11:35:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2021-01-06 11:35:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-01-06 11:35:55,192 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-01-06 11:35:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:55,192 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-01-06 11:35:55,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-01-06 11:35:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:35:55,194 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:55,194 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:55,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:35:55,195 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1120928325, now seen corresponding path program 1 times [2021-01-06 11:35:55,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:55,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201501384] [2021-01-06 11:35:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:55,241 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:55,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201501384] [2021-01-06 11:35:55,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:55,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:55,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60540000] [2021-01-06 11:35:55,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:55,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:55,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:55,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:55,244 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 3 states. [2021-01-06 11:35:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:55,430 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-01-06 11:35:55,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:55,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 11:35:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:55,438 INFO L225 Difference]: With dead ends: 664 [2021-01-06 11:35:55,438 INFO L226 Difference]: Without dead ends: 337 [2021-01-06 11:35:55,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-01-06 11:35:55,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-01-06 11:35:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2021-01-06 11:35:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-01-06 11:35:55,457 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-01-06 11:35:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:55,459 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-01-06 11:35:55,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-01-06 11:35:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:35:55,461 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:55,461 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:55,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:35:55,462 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:55,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1084775058, now seen corresponding path program 1 times [2021-01-06 11:35:55,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:55,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369269382] [2021-01-06 11:35:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:55,527 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:55,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369269382] [2021-01-06 11:35:55,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:55,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:55,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936949862] [2021-01-06 11:35:55,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:55,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:55,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:55,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:55,532 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand 3 states. [2021-01-06 11:35:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:55,744 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-01-06 11:35:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:55,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 11:35:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:55,747 INFO L225 Difference]: With dead ends: 697 [2021-01-06 11:35:55,747 INFO L226 Difference]: Without dead ends: 370 [2021-01-06 11:35:55,748 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:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-01-06 11:35:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-01-06 11:35:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2021-01-06 11:35:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-01-06 11:35:55,767 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-01-06 11:35:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:55,768 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-01-06 11:35:55,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-01-06 11:35:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 11:35:55,770 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:55,770 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:55,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:35:55,771 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:55,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:55,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1691577195, now seen corresponding path program 1 times [2021-01-06 11:35:55,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:55,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472484831] [2021-01-06 11:35:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:55,823 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:55,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472484831] [2021-01-06 11:35:55,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:55,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:55,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049617611] [2021-01-06 11:35:55,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:55,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:55,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:55,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:55,825 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 3 states. [2021-01-06 11:35:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:56,007 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-01-06 11:35:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:56,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2021-01-06 11:35:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:56,010 INFO L225 Difference]: With dead ends: 724 [2021-01-06 11:35:56,010 INFO L226 Difference]: Without dead ends: 370 [2021-01-06 11:35:56,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:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-01-06 11:35:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-01-06 11:35:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2021-01-06 11:35:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-01-06 11:35:56,028 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-01-06 11:35:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:56,028 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-01-06 11:35:56,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-01-06 11:35:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:35:56,030 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:56,031 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:56,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:35:56,031 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:56,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:56,032 INFO L82 PathProgramCache]: Analyzing trace with hash -479008336, now seen corresponding path program 1 times [2021-01-06 11:35:56,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:56,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205042147] [2021-01-06 11:35:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:56,072 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:56,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205042147] [2021-01-06 11:35:56,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:56,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:56,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301859995] [2021-01-06 11:35:56,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:56,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:56,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:56,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:56,074 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 3 states. [2021-01-06 11:35:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:56,238 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2021-01-06 11:35:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:56,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:35:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:56,241 INFO L225 Difference]: With dead ends: 741 [2021-01-06 11:35:56,241 INFO L226 Difference]: Without dead ends: 387 [2021-01-06 11:35:56,242 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:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-01-06 11:35:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-01-06 11:35:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-01-06 11:35:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-01-06 11:35:56,260 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-01-06 11:35:56,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:56,260 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-01-06 11:35:56,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-01-06 11:35:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:35:56,262 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:56,263 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:56,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:35:56,263 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:56,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:56,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2118869193, now seen corresponding path program 1 times [2021-01-06 11:35:56,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:56,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426491219] [2021-01-06 11:35:56,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:56,323 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:56,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426491219] [2021-01-06 11:35:56,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:56,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:56,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147557980] [2021-01-06 11:35:56,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:56,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:56,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:56,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:56,325 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 3 states. [2021-01-06 11:35:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:56,505 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2021-01-06 11:35:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:56,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:35:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:56,509 INFO L225 Difference]: With dead ends: 762 [2021-01-06 11:35:56,509 INFO L226 Difference]: Without dead ends: 387 [2021-01-06 11:35:56,511 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:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-01-06 11:35:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-01-06 11:35:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-01-06 11:35:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-01-06 11:35:56,536 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-01-06 11:35:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:56,536 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-01-06 11:35:56,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-01-06 11:35:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:35:56,538 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:56,538 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:56,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:35:56,539 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1932137040, now seen corresponding path program 1 times [2021-01-06 11:35:56,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:56,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584082946] [2021-01-06 11:35:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-01-06 11:35:56,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584082946] [2021-01-06 11:35:56,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:56,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:56,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618754719] [2021-01-06 11:35:56,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:56,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:56,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:56,623 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand 3 states. [2021-01-06 11:35:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:56,699 INFO L93 Difference]: Finished difference Result 758 states and 1198 transitions. [2021-01-06 11:35:56,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:56,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 11:35:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:56,707 INFO L225 Difference]: With dead ends: 758 [2021-01-06 11:35:56,707 INFO L226 Difference]: Without dead ends: 756 [2021-01-06 11:35:56,708 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:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-01-06 11:35:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2021-01-06 11:35:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2021-01-06 11:35:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1196 transitions. [2021-01-06 11:35:56,762 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1196 transitions. Word has length 121 [2021-01-06 11:35:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:56,763 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 1196 transitions. [2021-01-06 11:35:56,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1196 transitions. [2021-01-06 11:35:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:35:56,766 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:56,766 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:56,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:35:56,767 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:56,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1552830339, now seen corresponding path program 1 times [2021-01-06 11:35:56,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:56,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890386811] [2021-01-06 11:35:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:35:56,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890386811] [2021-01-06 11:35:56,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:56,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:56,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262655233] [2021-01-06 11:35:56,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:56,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:56,847 INFO L87 Difference]: Start difference. First operand 756 states and 1196 transitions. Second operand 3 states. [2021-01-06 11:35:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:56,938 INFO L93 Difference]: Finished difference Result 1832 states and 2900 transitions. [2021-01-06 11:35:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:56,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:35:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:56,949 INFO L225 Difference]: With dead ends: 1832 [2021-01-06 11:35:56,949 INFO L226 Difference]: Without dead ends: 1084 [2021-01-06 11:35:56,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-01-06 11:35:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2021-01-06 11:35:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2021-01-06 11:35:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1713 transitions. [2021-01-06 11:35:57,044 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1713 transitions. Word has length 122 [2021-01-06 11:35:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:57,045 INFO L481 AbstractCegarLoop]: Abstraction has 1084 states and 1713 transitions. [2021-01-06 11:35:57,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1713 transitions. [2021-01-06 11:35:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:35:57,050 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:57,051 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:57,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:35:57,051 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:57,052 INFO L82 PathProgramCache]: Analyzing trace with hash 323652479, now seen corresponding path program 1 times [2021-01-06 11:35:57,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:57,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049472925] [2021-01-06 11:35:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:35:57,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049472925] [2021-01-06 11:35:57,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:57,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:57,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90869776] [2021-01-06 11:35:57,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:57,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:57,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:57,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:57,108 INFO L87 Difference]: Start difference. First operand 1084 states and 1713 transitions. Second operand 3 states. [2021-01-06 11:35:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:57,198 INFO L93 Difference]: Finished difference Result 2529 states and 4000 transitions. [2021-01-06 11:35:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:57,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:35:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:57,207 INFO L225 Difference]: With dead ends: 2529 [2021-01-06 11:35:57,208 INFO L226 Difference]: Without dead ends: 1453 [2021-01-06 11:35:57,210 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:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2021-01-06 11:35:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2021-01-06 11:35:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2021-01-06 11:35:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2295 transitions. [2021-01-06 11:35:57,276 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2295 transitions. Word has length 122 [2021-01-06 11:35:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:57,276 INFO L481 AbstractCegarLoop]: Abstraction has 1453 states and 2295 transitions. [2021-01-06 11:35:57,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2295 transitions. [2021-01-06 11:35:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:35:57,280 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:57,281 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:57,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:35:57,281 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:57,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:57,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1712946493, now seen corresponding path program 1 times [2021-01-06 11:35:57,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:57,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342930916] [2021-01-06 11:35:57,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-01-06 11:35:57,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342930916] [2021-01-06 11:35:57,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:57,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:57,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835974635] [2021-01-06 11:35:57,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:57,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:57,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:57,328 INFO L87 Difference]: Start difference. First operand 1453 states and 2295 transitions. Second operand 3 states. [2021-01-06 11:35:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:57,423 INFO L93 Difference]: Finished difference Result 3249 states and 5133 transitions. [2021-01-06 11:35:57,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:57,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:35:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:57,435 INFO L225 Difference]: With dead ends: 3249 [2021-01-06 11:35:57,435 INFO L226 Difference]: Without dead ends: 1804 [2021-01-06 11:35:57,439 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:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2021-01-06 11:35:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2021-01-06 11:35:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2021-01-06 11:35:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2846 transitions. [2021-01-06 11:35:57,554 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2846 transitions. Word has length 122 [2021-01-06 11:35:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:57,555 INFO L481 AbstractCegarLoop]: Abstraction has 1804 states and 2846 transitions. [2021-01-06 11:35:57,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2846 transitions. [2021-01-06 11:35:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 11:35:57,561 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:57,561 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:57,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:35:57,561 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:57,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:57,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1532697181, now seen corresponding path program 1 times [2021-01-06 11:35:57,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:57,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959456445] [2021-01-06 11:35:57,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-01-06 11:35:57,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959456445] [2021-01-06 11:35:57,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:57,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:57,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028287486] [2021-01-06 11:35:57,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:57,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:57,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:57,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:57,638 INFO L87 Difference]: Start difference. First operand 1804 states and 2846 transitions. Second operand 3 states. [2021-01-06 11:35:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:57,903 INFO L93 Difference]: Finished difference Result 3650 states and 5740 transitions. [2021-01-06 11:35:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:57,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2021-01-06 11:35:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:57,914 INFO L225 Difference]: With dead ends: 3650 [2021-01-06 11:35:57,914 INFO L226 Difference]: Without dead ends: 1854 [2021-01-06 11:35:57,917 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:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2021-01-06 11:35:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1804. [2021-01-06 11:35:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2021-01-06 11:35:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2774 transitions. [2021-01-06 11:35:58,029 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2774 transitions. Word has length 199 [2021-01-06 11:35:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:58,030 INFO L481 AbstractCegarLoop]: Abstraction has 1804 states and 2774 transitions. [2021-01-06 11:35:58,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2774 transitions. [2021-01-06 11:35:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-01-06 11:35:58,038 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:58,038 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:58,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:35:58,038 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:58,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash -995291011, now seen corresponding path program 1 times [2021-01-06 11:35:58,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:58,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966432521] [2021-01-06 11:35:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-01-06 11:35:58,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966432521] [2021-01-06 11:35:58,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:35:58,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:35:58,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120215054] [2021-01-06 11:35:58,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:35:58,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:58,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:35:58,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:35:58,145 INFO L87 Difference]: Start difference. First operand 1804 states and 2774 transitions. Second operand 3 states. [2021-01-06 11:35:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:58,430 INFO L93 Difference]: Finished difference Result 3667 states and 5613 transitions. [2021-01-06 11:35:58,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:35:58,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2021-01-06 11:35:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:58,443 INFO L225 Difference]: With dead ends: 3667 [2021-01-06 11:35:58,443 INFO L226 Difference]: Without dead ends: 1871 [2021-01-06 11:35:58,447 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:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2021-01-06 11:35:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1804. [2021-01-06 11:35:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2021-01-06 11:35:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2698 transitions. [2021-01-06 11:35:58,533 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2698 transitions. Word has length 213 [2021-01-06 11:35:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:58,533 INFO L481 AbstractCegarLoop]: Abstraction has 1804 states and 2698 transitions. [2021-01-06 11:35:58,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:35:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2698 transitions. [2021-01-06 11:35:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-01-06 11:35:58,540 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:58,540 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:35:58,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:35:58,540 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:35:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:35:58,541 INFO L82 PathProgramCache]: Analyzing trace with hash -344869126, now seen corresponding path program 1 times [2021-01-06 11:35:58,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:35:58,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247992414] [2021-01-06 11:35:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:35:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-06 11:35:58,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247992414] [2021-01-06 11:35:58,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739454940] [2021-01-06 11:35:58,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:35:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:35:58,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:35:58,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:35:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-06 11:35:59,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:35:59,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:35:59,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538349844] [2021-01-06 11:35:59,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:35:59,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:35:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:35:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:35:59,364 INFO L87 Difference]: Start difference. First operand 1804 states and 2698 transitions. Second operand 4 states. [2021-01-06 11:35:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:35:59,864 INFO L93 Difference]: Finished difference Result 4265 states and 6329 transitions. [2021-01-06 11:35:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:35:59,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2021-01-06 11:35:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:35:59,876 INFO L225 Difference]: With dead ends: 4265 [2021-01-06 11:35:59,876 INFO L226 Difference]: Without dead ends: 2436 [2021-01-06 11:35:59,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:35:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2021-01-06 11:35:59,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1604. [2021-01-06 11:35:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2021-01-06 11:35:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2362 transitions. [2021-01-06 11:35:59,972 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2362 transitions. Word has length 232 [2021-01-06 11:35:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:35:59,973 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2362 transitions. [2021-01-06 11:35:59,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:35:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2362 transitions. [2021-01-06 11:35:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-01-06 11:35:59,979 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:35:59,979 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:00,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-06 11:36:00,195 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:00,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1731638989, now seen corresponding path program 1 times [2021-01-06 11:36:00,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:00,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220989645] [2021-01-06 11:36:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2021-01-06 11:36:00,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220989645] [2021-01-06 11:36:00,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:00,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:00,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137073933] [2021-01-06 11:36:00,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:00,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:00,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:00,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:00,316 INFO L87 Difference]: Start difference. First operand 1604 states and 2362 transitions. Second operand 3 states. [2021-01-06 11:36:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:00,555 INFO L93 Difference]: Finished difference Result 3395 states and 5017 transitions. [2021-01-06 11:36:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:00,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2021-01-06 11:36:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:00,566 INFO L225 Difference]: With dead ends: 3395 [2021-01-06 11:36:00,566 INFO L226 Difference]: Without dead ends: 1679 [2021-01-06 11:36:00,570 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:36:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2021-01-06 11:36:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2021-01-06 11:36:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2021-01-06 11:36:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2427 transitions. [2021-01-06 11:36:00,655 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2427 transitions. Word has length 241 [2021-01-06 11:36:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:00,656 INFO L481 AbstractCegarLoop]: Abstraction has 1679 states and 2427 transitions. [2021-01-06 11:36:00,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2427 transitions. [2021-01-06 11:36:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-01-06 11:36:00,662 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:00,663 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:00,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:36:00,663 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:00,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1272517136, now seen corresponding path program 1 times [2021-01-06 11:36:00,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:00,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508738429] [2021-01-06 11:36:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-01-06 11:36:00,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508738429] [2021-01-06 11:36:00,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642274015] [2021-01-06 11:36:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:00,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:36:00,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:36:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-01-06 11:36:01,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:36:01,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:36:01,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230620276] [2021-01-06 11:36:01,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:36:01,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:01,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:36:01,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:36:01,241 INFO L87 Difference]: Start difference. First operand 1679 states and 2427 transitions. Second operand 4 states. [2021-01-06 11:36:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:01,818 INFO L93 Difference]: Finished difference Result 5320 states and 7733 transitions. [2021-01-06 11:36:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:36:01,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2021-01-06 11:36:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:01,838 INFO L225 Difference]: With dead ends: 5320 [2021-01-06 11:36:01,838 INFO L226 Difference]: Without dead ends: 3649 [2021-01-06 11:36:01,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:36:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2021-01-06 11:36:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 2004. [2021-01-06 11:36:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2004 states. [2021-01-06 11:36:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2729 transitions. [2021-01-06 11:36:01,953 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2729 transitions. Word has length 253 [2021-01-06 11:36:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:01,954 INFO L481 AbstractCegarLoop]: Abstraction has 2004 states and 2729 transitions. [2021-01-06 11:36:01,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:36:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2729 transitions. [2021-01-06 11:36:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-01-06 11:36:01,960 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:01,961 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:02,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-06 11:36:02,176 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:02,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:02,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1561336526, now seen corresponding path program 1 times [2021-01-06 11:36:02,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:02,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601841510] [2021-01-06 11:36:02,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-01-06 11:36:02,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601841510] [2021-01-06 11:36:02,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:02,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:02,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726452789] [2021-01-06 11:36:02,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:02,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:02,306 INFO L87 Difference]: Start difference. First operand 2004 states and 2729 transitions. Second operand 3 states. [2021-01-06 11:36:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:02,457 INFO L93 Difference]: Finished difference Result 5742 states and 7864 transitions. [2021-01-06 11:36:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:02,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2021-01-06 11:36:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:02,478 INFO L225 Difference]: With dead ends: 5742 [2021-01-06 11:36:02,478 INFO L226 Difference]: Without dead ends: 3746 [2021-01-06 11:36:02,482 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:36:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2021-01-06 11:36:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3744. [2021-01-06 11:36:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3744 states. [2021-01-06 11:36:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5134 transitions. [2021-01-06 11:36:02,721 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5134 transitions. Word has length 253 [2021-01-06 11:36:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:02,722 INFO L481 AbstractCegarLoop]: Abstraction has 3744 states and 5134 transitions. [2021-01-06 11:36:02,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5134 transitions. [2021-01-06 11:36:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-01-06 11:36:02,731 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:02,732 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:02,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:36:02,732 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:02,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:02,733 INFO L82 PathProgramCache]: Analyzing trace with hash -914284920, now seen corresponding path program 1 times [2021-01-06 11:36:02,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:02,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178673858] [2021-01-06 11:36:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-01-06 11:36:02,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178673858] [2021-01-06 11:36:02,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:02,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:02,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566466672] [2021-01-06 11:36:02,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:02,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:02,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:02,828 INFO L87 Difference]: Start difference. First operand 3744 states and 5134 transitions. Second operand 3 states. [2021-01-06 11:36:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:03,159 INFO L93 Difference]: Finished difference Result 7698 states and 10554 transitions. [2021-01-06 11:36:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:03,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2021-01-06 11:36:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:03,174 INFO L225 Difference]: With dead ends: 7698 [2021-01-06 11:36:03,174 INFO L226 Difference]: Without dead ends: 3962 [2021-01-06 11:36:03,180 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:36:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2021-01-06 11:36:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3744. [2021-01-06 11:36:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3744 states. [2021-01-06 11:36:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5030 transitions. [2021-01-06 11:36:03,418 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5030 transitions. Word has length 256 [2021-01-06 11:36:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:03,419 INFO L481 AbstractCegarLoop]: Abstraction has 3744 states and 5030 transitions. [2021-01-06 11:36:03,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5030 transitions. [2021-01-06 11:36:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2021-01-06 11:36:03,429 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:03,429 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:03,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:36:03,430 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:03,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1357789354, now seen corresponding path program 1 times [2021-01-06 11:36:03,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:03,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418876581] [2021-01-06 11:36:03,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2021-01-06 11:36:03,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418876581] [2021-01-06 11:36:03,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:03,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:03,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028701310] [2021-01-06 11:36:03,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:03,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:03,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:03,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:03,529 INFO L87 Difference]: Start difference. First operand 3744 states and 5030 transitions. Second operand 3 states. [2021-01-06 11:36:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:03,835 INFO L93 Difference]: Finished difference Result 7612 states and 10230 transitions. [2021-01-06 11:36:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:03,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2021-01-06 11:36:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:03,859 INFO L225 Difference]: With dead ends: 7612 [2021-01-06 11:36:03,859 INFO L226 Difference]: Without dead ends: 3876 [2021-01-06 11:36:03,866 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:36:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3876 states. [2021-01-06 11:36:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3876 to 3836. [2021-01-06 11:36:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2021-01-06 11:36:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5142 transitions. [2021-01-06 11:36:04,100 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5142 transitions. Word has length 290 [2021-01-06 11:36:04,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:04,100 INFO L481 AbstractCegarLoop]: Abstraction has 3836 states and 5142 transitions. [2021-01-06 11:36:04,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5142 transitions. [2021-01-06 11:36:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-01-06 11:36:04,112 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:04,112 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:04,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:36:04,113 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:04,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:04,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1702375352, now seen corresponding path program 1 times [2021-01-06 11:36:04,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:04,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735478967] [2021-01-06 11:36:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2021-01-06 11:36:04,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735478967] [2021-01-06 11:36:04,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:04,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:04,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567634308] [2021-01-06 11:36:04,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:04,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:04,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:04,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:04,298 INFO L87 Difference]: Start difference. First operand 3836 states and 5142 transitions. Second operand 3 states. [2021-01-06 11:36:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:04,573 INFO L93 Difference]: Finished difference Result 8044 states and 10852 transitions. [2021-01-06 11:36:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:04,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2021-01-06 11:36:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:04,585 INFO L225 Difference]: With dead ends: 8044 [2021-01-06 11:36:04,585 INFO L226 Difference]: Without dead ends: 4216 [2021-01-06 11:36:04,591 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:36:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2021-01-06 11:36:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 4086. [2021-01-06 11:36:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2021-01-06 11:36:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 5442 transitions. [2021-01-06 11:36:04,813 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 5442 transitions. Word has length 311 [2021-01-06 11:36:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:04,813 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 5442 transitions. [2021-01-06 11:36:04,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 5442 transitions. [2021-01-06 11:36:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2021-01-06 11:36:04,824 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:04,825 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:04,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:36:04,825 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:04,826 INFO L82 PathProgramCache]: Analyzing trace with hash 602793911, now seen corresponding path program 1 times [2021-01-06 11:36:04,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:04,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949711927] [2021-01-06 11:36:04,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2021-01-06 11:36:04,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949711927] [2021-01-06 11:36:04,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:04,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:04,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388157733] [2021-01-06 11:36:04,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:04,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:04,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:04,956 INFO L87 Difference]: Start difference. First operand 4086 states and 5442 transitions. Second operand 3 states. [2021-01-06 11:36:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:05,159 INFO L93 Difference]: Finished difference Result 6855 states and 9019 transitions. [2021-01-06 11:36:05,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:05,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2021-01-06 11:36:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:05,165 INFO L225 Difference]: With dead ends: 6855 [2021-01-06 11:36:05,166 INFO L226 Difference]: Without dead ends: 2133 [2021-01-06 11:36:05,172 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:36:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2021-01-06 11:36:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2133. [2021-01-06 11:36:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2021-01-06 11:36:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2774 transitions. [2021-01-06 11:36:05,251 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2774 transitions. Word has length 321 [2021-01-06 11:36:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:05,251 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2774 transitions. [2021-01-06 11:36:05,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2774 transitions. [2021-01-06 11:36:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2021-01-06 11:36:05,259 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:05,260 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:05,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:36:05,260 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:05,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:05,261 INFO L82 PathProgramCache]: Analyzing trace with hash -616309997, now seen corresponding path program 1 times [2021-01-06 11:36:05,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:05,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537686780] [2021-01-06 11:36:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2021-01-06 11:36:05,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537686780] [2021-01-06 11:36:05,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:05,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:05,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388179307] [2021-01-06 11:36:05,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:05,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:05,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:05,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:05,419 INFO L87 Difference]: Start difference. First operand 2133 states and 2774 transitions. Second operand 3 states. [2021-01-06 11:36:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:05,620 INFO L93 Difference]: Finished difference Result 4298 states and 5601 transitions. [2021-01-06 11:36:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:05,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2021-01-06 11:36:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:05,628 INFO L225 Difference]: With dead ends: 4298 [2021-01-06 11:36:05,628 INFO L226 Difference]: Without dead ends: 2173 [2021-01-06 11:36:05,634 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:36:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2021-01-06 11:36:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2133. [2021-01-06 11:36:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2021-01-06 11:36:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2734 transitions. [2021-01-06 11:36:05,719 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2734 transitions. Word has length 337 [2021-01-06 11:36:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:05,720 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2734 transitions. [2021-01-06 11:36:05,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2734 transitions. [2021-01-06 11:36:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-01-06 11:36:05,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:05,729 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:05,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:36:05,730 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:05,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:05,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1063549815, now seen corresponding path program 1 times [2021-01-06 11:36:05,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:05,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030572116] [2021-01-06 11:36:05,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-01-06 11:36:05,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030572116] [2021-01-06 11:36:05,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:05,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:05,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964444667] [2021-01-06 11:36:05,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:05,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:05,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:05,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:05,888 INFO L87 Difference]: Start difference. First operand 2133 states and 2734 transitions. Second operand 3 states. [2021-01-06 11:36:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:06,085 INFO L93 Difference]: Finished difference Result 4268 states and 5466 transitions. [2021-01-06 11:36:06,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:06,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2021-01-06 11:36:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:06,091 INFO L225 Difference]: With dead ends: 4268 [2021-01-06 11:36:06,092 INFO L226 Difference]: Without dead ends: 2143 [2021-01-06 11:36:06,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2021-01-06 11:36:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2133. [2021-01-06 11:36:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2021-01-06 11:36:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2694 transitions. [2021-01-06 11:36:06,200 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2694 transitions. Word has length 360 [2021-01-06 11:36:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:06,200 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 2694 transitions. [2021-01-06 11:36:06,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2694 transitions. [2021-01-06 11:36:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2021-01-06 11:36:06,209 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:06,210 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:06,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:36:06,210 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:06,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:06,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2107174257, now seen corresponding path program 1 times [2021-01-06 11:36:06,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:06,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005355110] [2021-01-06 11:36:06,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-01-06 11:36:06,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005355110] [2021-01-06 11:36:06,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717820368] [2021-01-06 11:36:06,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:06,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:36:06,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:36:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2021-01-06 11:36:07,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:36:07,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 11:36:07,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787119350] [2021-01-06 11:36:07,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:07,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:07,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:07,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:36:07,143 INFO L87 Difference]: Start difference. First operand 2133 states and 2694 transitions. Second operand 3 states. [2021-01-06 11:36:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:07,239 INFO L93 Difference]: Finished difference Result 2711 states and 3448 transitions. [2021-01-06 11:36:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:07,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2021-01-06 11:36:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:07,247 INFO L225 Difference]: With dead ends: 2711 [2021-01-06 11:36:07,247 INFO L226 Difference]: Without dead ends: 2573 [2021-01-06 11:36:07,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:36:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2021-01-06 11:36:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1997. [2021-01-06 11:36:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2021-01-06 11:36:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2540 transitions. [2021-01-06 11:36:07,343 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2540 transitions. Word has length 393 [2021-01-06 11:36:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:07,344 INFO L481 AbstractCegarLoop]: Abstraction has 1997 states and 2540 transitions. [2021-01-06 11:36:07,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2540 transitions. [2021-01-06 11:36:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2021-01-06 11:36:07,360 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:07,360 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:07,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:07,575 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:07,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:07,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2021892229, now seen corresponding path program 1 times [2021-01-06 11:36:07,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:07,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241710509] [2021-01-06 11:36:07,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-01-06 11:36:07,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241710509] [2021-01-06 11:36:07,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809432317] [2021-01-06 11:36:07,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:07,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:36:07,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:36:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-01-06 11:36:08,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:36:08,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:36:08,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376300106] [2021-01-06 11:36:08,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:36:08,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:08,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:36:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:36:08,270 INFO L87 Difference]: Start difference. First operand 1997 states and 2540 transitions. Second operand 4 states. [2021-01-06 11:36:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:08,597 INFO L93 Difference]: Finished difference Result 5016 states and 6404 transitions. [2021-01-06 11:36:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:36:08,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2021-01-06 11:36:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:08,604 INFO L225 Difference]: With dead ends: 5016 [2021-01-06 11:36:08,604 INFO L226 Difference]: Without dead ends: 2985 [2021-01-06 11:36:08,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:36:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2021-01-06 11:36:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2157. [2021-01-06 11:36:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2021-01-06 11:36:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 2760 transitions. [2021-01-06 11:36:08,693 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 2760 transitions. Word has length 409 [2021-01-06 11:36:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:08,694 INFO L481 AbstractCegarLoop]: Abstraction has 2157 states and 2760 transitions. [2021-01-06 11:36:08,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:36:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2760 transitions. [2021-01-06 11:36:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2021-01-06 11:36:08,706 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:08,707 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:08,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:08,922 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:08,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1865506571, now seen corresponding path program 1 times [2021-01-06 11:36:08,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:08,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827804637] [2021-01-06 11:36:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2021-01-06 11:36:09,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827804637] [2021-01-06 11:36:09,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:09,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:09,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438237094] [2021-01-06 11:36:09,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:09,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:09,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:09,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:09,182 INFO L87 Difference]: Start difference. First operand 2157 states and 2760 transitions. Second operand 3 states. [2021-01-06 11:36:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:09,382 INFO L93 Difference]: Finished difference Result 4486 states and 5763 transitions. [2021-01-06 11:36:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:09,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 471 [2021-01-06 11:36:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:09,388 INFO L225 Difference]: With dead ends: 4486 [2021-01-06 11:36:09,389 INFO L226 Difference]: Without dead ends: 2337 [2021-01-06 11:36:09,392 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:36:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2021-01-06 11:36:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2327. [2021-01-06 11:36:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2021-01-06 11:36:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 2955 transitions. [2021-01-06 11:36:09,476 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 2955 transitions. Word has length 471 [2021-01-06 11:36:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:09,476 INFO L481 AbstractCegarLoop]: Abstraction has 2327 states and 2955 transitions. [2021-01-06 11:36:09,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2955 transitions. [2021-01-06 11:36:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2021-01-06 11:36:09,483 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:09,484 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:09,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:36:09,484 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1625661125, now seen corresponding path program 1 times [2021-01-06 11:36:09,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:09,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968272035] [2021-01-06 11:36:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2021-01-06 11:36:09,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968272035] [2021-01-06 11:36:09,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:09,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:09,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825519086] [2021-01-06 11:36:09,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:09,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:09,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:09,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:09,783 INFO L87 Difference]: Start difference. First operand 2327 states and 2955 transitions. Second operand 3 states. [2021-01-06 11:36:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:09,992 INFO L93 Difference]: Finished difference Result 4641 states and 5888 transitions. [2021-01-06 11:36:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:09,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 533 [2021-01-06 11:36:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:09,998 INFO L225 Difference]: With dead ends: 4641 [2021-01-06 11:36:09,998 INFO L226 Difference]: Without dead ends: 2322 [2021-01-06 11:36:10,001 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:36:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2021-01-06 11:36:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2021-01-06 11:36:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2021-01-06 11:36:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 2885 transitions. [2021-01-06 11:36:10,082 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 2885 transitions. Word has length 533 [2021-01-06 11:36:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:10,083 INFO L481 AbstractCegarLoop]: Abstraction has 2322 states and 2885 transitions. [2021-01-06 11:36:10,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2885 transitions. [2021-01-06 11:36:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2021-01-06 11:36:10,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:10,091 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:10,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:36:10,091 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1600887189, now seen corresponding path program 1 times [2021-01-06 11:36:10,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:10,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87652640] [2021-01-06 11:36:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-01-06 11:36:10,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87652640] [2021-01-06 11:36:10,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002670602] [2021-01-06 11:36:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:36:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:10,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:36:10,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:36:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-01-06 11:36:11,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:36:11,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:36:11,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936065570] [2021-01-06 11:36:11,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:36:11,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:36:11,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:36:11,300 INFO L87 Difference]: Start difference. First operand 2322 states and 2885 transitions. Second operand 4 states. [2021-01-06 11:36:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:11,529 INFO L93 Difference]: Finished difference Result 3917 states and 4895 transitions. [2021-01-06 11:36:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:36:11,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2021-01-06 11:36:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:11,531 INFO L225 Difference]: With dead ends: 3917 [2021-01-06 11:36:11,531 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 11:36:11,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:36:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 11:36:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 11:36:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 11:36:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 11:36:11,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2021-01-06 11:36:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:11,537 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 11:36:11,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:36:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 11:36:11,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 11:36:11,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-06 11:36:11,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 11:36:12,946 WARN L197 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 208 [2021-01-06 11:36:14,028 WARN L197 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 208 [2021-01-06 11:36:14,683 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2021-01-06 11:36:14,973 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 34 [2021-01-06 11:36:15,224 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2021-01-06 11:36:15,764 WARN L197 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2021-01-06 11:36:18,815 WARN L197 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 172 DAG size of output: 106 [2021-01-06 11:36:19,428 WARN L197 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2021-01-06 11:36:19,848 WARN L197 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2021-01-06 11:36:20,129 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 22 [2021-01-06 11:36:20,529 WARN L197 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2021-01-06 11:36:20,985 WARN L197 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2021-01-06 11:36:24,043 WARN L197 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 172 DAG size of output: 106 [2021-01-06 11:36:24,456 WARN L197 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2021-01-06 11:36:25,018 WARN L197 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2021-01-06 11:36:25,370 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2021-01-06 11:36:25,651 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2021-01-06 11:36:26,047 WARN L197 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2021-01-06 11:36:26,437 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2021-01-06 11:36:26,728 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2021-01-06 11:36:26,968 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 24 [2021-01-06 11:36:27,584 WARN L197 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2021-01-06 11:36:27,839 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 19 [2021-01-06 11:36:27,843 INFO L189 CegarLoopUtils]: For program point L531(lines 531 537) no Hoare annotation was computed. [2021-01-06 11:36:27,843 INFO L189 CegarLoopUtils]: For program point L531-1(lines 531 537) no Hoare annotation was computed. [2021-01-06 11:36:27,844 INFO L189 CegarLoopUtils]: For program point L334(lines 334 368) no Hoare annotation was computed. [2021-01-06 11:36:27,844 INFO L189 CegarLoopUtils]: For program point L334-1(lines 334 368) no Hoare annotation was computed. [2021-01-06 11:36:27,844 INFO L189 CegarLoopUtils]: For program point L202(lines 202 547) no Hoare annotation was computed. [2021-01-06 11:36:27,844 INFO L189 CegarLoopUtils]: For program point L169(lines 169 558) no Hoare annotation was computed. [2021-01-06 11:36:27,844 INFO L189 CegarLoopUtils]: For program point L136(lines 136 569) no Hoare annotation was computed. [2021-01-06 11:36:27,845 INFO L189 CegarLoopUtils]: For program point L103(lines 103 580) no Hoare annotation was computed. [2021-01-06 11:36:27,845 INFO L189 CegarLoopUtils]: For program point L467(lines 467 469) no Hoare annotation was computed. [2021-01-06 11:36:27,845 INFO L189 CegarLoopUtils]: For program point L401(lines 401 403) no Hoare annotation was computed. [2021-01-06 11:36:27,845 INFO L189 CegarLoopUtils]: For program point L335(lines 335 365) no Hoare annotation was computed. [2021-01-06 11:36:27,846 INFO L185 CegarLoopUtils]: At program point L203(lines 199 548) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse2 .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse0 .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1))) [2021-01-06 11:36:27,846 INFO L185 CegarLoopUtils]: At program point L104(lines 103 580) the Hoare annotation is: false [2021-01-06 11:36:27,846 INFO L192 CegarLoopUtils]: At program point L600(lines 99 601) the Hoare annotation is: true [2021-01-06 11:36:27,846 INFO L189 CegarLoopUtils]: For program point L534(lines 534 536) no Hoare annotation was computed. [2021-01-06 11:36:27,846 INFO L189 CegarLoopUtils]: For program point L205(lines 205 546) no Hoare annotation was computed. [2021-01-06 11:36:27,846 INFO L189 CegarLoopUtils]: For program point L172(lines 172 557) no Hoare annotation was computed. [2021-01-06 11:36:27,846 INFO L189 CegarLoopUtils]: For program point L139(lines 139 568) no Hoare annotation was computed. [2021-01-06 11:36:27,846 INFO L189 CegarLoopUtils]: For program point L106(lines 106 579) no Hoare annotation was computed. [2021-01-06 11:36:27,847 INFO L189 CegarLoopUtils]: For program point L305(lines 305 312) no Hoare annotation was computed. [2021-01-06 11:36:27,847 INFO L189 CegarLoopUtils]: For program point L305-2(lines 305 312) no Hoare annotation was computed. [2021-01-06 11:36:27,847 INFO L185 CegarLoopUtils]: At program point L206(lines 205 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-01-06 11:36:27,847 INFO L185 CegarLoopUtils]: At program point L173(lines 169 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2 .cse5 .cse6 .cse7 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-01-06 11:36:27,847 INFO L185 CegarLoopUtils]: At program point L140(lines 136 569) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-01-06 11:36:27,848 INFO L189 CegarLoopUtils]: For program point L340(lines 340 363) no Hoare annotation was computed. [2021-01-06 11:36:27,848 INFO L185 CegarLoopUtils]: At program point L208(lines 207 546) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-01-06 11:36:27,848 INFO L189 CegarLoopUtils]: For program point L175(lines 175 556) no Hoare annotation was computed. [2021-01-06 11:36:27,848 INFO L189 CegarLoopUtils]: For program point L142(lines 142 567) no Hoare annotation was computed. [2021-01-06 11:36:27,848 INFO L189 CegarLoopUtils]: For program point L109(lines 109 578) no Hoare annotation was computed. [2021-01-06 11:36:27,848 INFO L189 CegarLoopUtils]: For program point L605(lines 605 607) no Hoare annotation was computed. [2021-01-06 11:36:27,848 INFO L189 CegarLoopUtils]: For program point L605-2(lines 605 607) no Hoare annotation was computed. [2021-01-06 11:36:27,848 INFO L189 CegarLoopUtils]: For program point L506(lines 506 509) no Hoare annotation was computed. [2021-01-06 11:36:27,848 INFO L189 CegarLoopUtils]: For program point L275(lines 275 277) no Hoare annotation was computed. [2021-01-06 11:36:27,849 INFO L189 CegarLoopUtils]: For program point L275-2(lines 209 543) no Hoare annotation was computed. [2021-01-06 11:36:27,849 INFO L189 CegarLoopUtils]: For program point L441(lines 441 443) no Hoare annotation was computed. [2021-01-06 11:36:27,849 INFO L189 CegarLoopUtils]: For program point L309(lines 309 311) no Hoare annotation was computed. [2021-01-06 11:36:27,849 INFO L189 CegarLoopUtils]: For program point L343(lines 343 347) no Hoare annotation was computed. [2021-01-06 11:36:27,849 INFO L189 CegarLoopUtils]: For program point L343-2(lines 343 347) no Hoare annotation was computed. [2021-01-06 11:36:27,849 INFO L189 CegarLoopUtils]: For program point L244(lines 244 254) no Hoare annotation was computed. [2021-01-06 11:36:27,849 INFO L189 CegarLoopUtils]: For program point L178(lines 178 555) no Hoare annotation was computed. [2021-01-06 11:36:27,849 INFO L189 CegarLoopUtils]: For program point L145(lines 145 566) no Hoare annotation was computed. [2021-01-06 11:36:27,849 INFO L189 CegarLoopUtils]: For program point L112(lines 112 577) no Hoare annotation was computed. [2021-01-06 11:36:27,850 INFO L189 CegarLoopUtils]: For program point L476(lines 476 478) no Hoare annotation was computed. [2021-01-06 11:36:27,850 INFO L189 CegarLoopUtils]: For program point L377(lines 377 409) no Hoare annotation was computed. [2021-01-06 11:36:27,850 INFO L189 CegarLoopUtils]: For program point L245(lines 245 248) no Hoare annotation was computed. [2021-01-06 11:36:27,850 INFO L185 CegarLoopUtils]: At program point L212(lines 106 579) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-01-06 11:36:27,850 INFO L185 CegarLoopUtils]: At program point L179(lines 175 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2 .cse5 .cse6 .cse7 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-01-06 11:36:27,850 INFO L185 CegarLoopUtils]: At program point L146(lines 142 567) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-01-06 11:36:27,851 INFO L189 CegarLoopUtils]: For program point L444(lines 444 453) no Hoare annotation was computed. [2021-01-06 11:36:27,851 INFO L189 CegarLoopUtils]: For program point L378(lines 378 384) no Hoare annotation was computed. [2021-01-06 11:36:27,851 INFO L192 CegarLoopUtils]: At program point L610(lines 12 612) the Hoare annotation is: true [2021-01-06 11:36:27,851 INFO L185 CegarLoopUtils]: At program point L544(lines 100 599) the Hoare annotation is: (let ((.cse22 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse26 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse23 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse24 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse25 (not .cse4)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse10 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not .cse26)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse30 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not .cse22)) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse5) (and .cse0 .cse4 .cse6 .cse5) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse9 .cse20) (and .cse0 .cse9 .cse6) (and .cse21 .cse22) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse6 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse23 .cse18 .cse24 .cse25) (and .cse21 .cse26) (and .cse23 .cse20) (and .cse9 .cse18 .cse24) (and .cse7 .cse8 .cse9 .cse17 .cse10 .cse12 .cse6 .cse14 .cse19) (and .cse27 .cse23 .cse14 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse25) (and .cse0 .cse13 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse27 .cse4 .cse14) (and .cse2 .cse9 .cse28 .cse4 .cse24) (and .cse0 .cse2 .cse28 .cse24 .cse29 .cse5) (and .cse1 .cse2 .cse3 .cse25) (and .cse4 .cse26 .cse5) (and .cse0 .cse30 .cse4 .cse5) (and .cse21 .cse2 .cse28 .cse24) (and .cse5 .cse20) (and .cse0 .cse21 .cse6) (and .cse2 .cse28 .cse24 .cse29 .cse5 .cse25) (and .cse21 .cse20) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse4 .cse5) (and .cse4 .cse22 .cse5) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2021-01-06 11:36:27,851 INFO L189 CegarLoopUtils]: For program point L181(lines 181 554) no Hoare annotation was computed. [2021-01-06 11:36:27,852 INFO L189 CegarLoopUtils]: For program point L148(lines 148 565) no Hoare annotation was computed. [2021-01-06 11:36:27,852 INFO L189 CegarLoopUtils]: For program point L115(lines 115 576) no Hoare annotation was computed. [2021-01-06 11:36:27,852 INFO L189 CegarLoopUtils]: For program point L479(lines 479 483) no Hoare annotation was computed. [2021-01-06 11:36:27,852 INFO L189 CegarLoopUtils]: For program point L479-2(lines 479 483) no Hoare annotation was computed. [2021-01-06 11:36:27,852 INFO L189 CegarLoopUtils]: For program point L83(lines 83 89) no Hoare annotation was computed. [2021-01-06 11:36:27,852 INFO L189 CegarLoopUtils]: For program point L514(lines 514 516) no Hoare annotation was computed. [2021-01-06 11:36:27,852 INFO L189 CegarLoopUtils]: For program point L448(lines 448 450) no Hoare annotation was computed. [2021-01-06 11:36:27,852 INFO L189 CegarLoopUtils]: For program point L217(lines 217 219) no Hoare annotation was computed. [2021-01-06 11:36:27,852 INFO L189 CegarLoopUtils]: For program point L184(lines 184 553) no Hoare annotation was computed. [2021-01-06 11:36:27,853 INFO L189 CegarLoopUtils]: For program point L151(lines 151 564) no Hoare annotation was computed. [2021-01-06 11:36:27,853 INFO L189 CegarLoopUtils]: For program point L217-2(lines 217 219) no Hoare annotation was computed. [2021-01-06 11:36:27,853 INFO L189 CegarLoopUtils]: For program point L118(lines 118 575) no Hoare annotation was computed. [2021-01-06 11:36:27,853 INFO L189 CegarLoopUtils]: For program point L581(lines 581 597) no Hoare annotation was computed. [2021-01-06 11:36:27,853 INFO L185 CegarLoopUtils]: At program point L515(lines 73 611) the Hoare annotation is: false [2021-01-06 11:36:27,853 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 11:36:27,853 INFO L185 CegarLoopUtils]: At program point L185(lines 181 554) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0))) [2021-01-06 11:36:27,854 INFO L185 CegarLoopUtils]: At program point L152(lines 148 565) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-01-06 11:36:27,854 INFO L189 CegarLoopUtils]: For program point L86(lines 86 88) no Hoare annotation was computed. [2021-01-06 11:36:27,854 INFO L189 CegarLoopUtils]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2021-01-06 11:36:27,854 INFO L189 CegarLoopUtils]: For program point L582(lines 582 596) no Hoare annotation was computed. [2021-01-06 11:36:27,854 INFO L189 CegarLoopUtils]: For program point L351(lines 351 359) no Hoare annotation was computed. [2021-01-06 11:36:27,854 INFO L189 CegarLoopUtils]: For program point L583(lines 583 588) no Hoare annotation was computed. [2021-01-06 11:36:27,854 INFO L189 CegarLoopUtils]: For program point L517(lines 517 519) no Hoare annotation was computed. [2021-01-06 11:36:27,855 INFO L189 CegarLoopUtils]: For program point L583-2(lines 582 596) no Hoare annotation was computed. [2021-01-06 11:36:27,855 INFO L185 CegarLoopUtils]: At program point L352(lines 328 370) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-01-06 11:36:27,855 INFO L189 CegarLoopUtils]: For program point L187(lines 187 552) no Hoare annotation was computed. [2021-01-06 11:36:27,855 INFO L189 CegarLoopUtils]: For program point L154(lines 154 563) no Hoare annotation was computed. [2021-01-06 11:36:27,855 INFO L189 CegarLoopUtils]: For program point L121(lines 121 574) no Hoare annotation was computed. [2021-01-06 11:36:27,855 INFO L189 CegarLoopUtils]: For program point L419(lines 419 421) no Hoare annotation was computed. [2021-01-06 11:36:27,856 INFO L185 CegarLoopUtils]: At program point L386(lines 377 409) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-01-06 11:36:27,856 INFO L185 CegarLoopUtils]: At program point L122(lines 118 575) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse1 .cse0 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse0 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-01-06 11:36:27,856 INFO L189 CegarLoopUtils]: For program point L585(lines 585 587) no Hoare annotation was computed. [2021-01-06 11:36:27,856 INFO L189 CegarLoopUtils]: For program point L354(lines 354 356) no Hoare annotation was computed. [2021-01-06 11:36:27,856 INFO L189 CegarLoopUtils]: For program point L288(lines 288 290) no Hoare annotation was computed. [2021-01-06 11:36:27,856 INFO L189 CegarLoopUtils]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-01-06 11:36:27,856 INFO L189 CegarLoopUtils]: For program point L288-2(lines 209 543) no Hoare annotation was computed. [2021-01-06 11:36:27,857 INFO L189 CegarLoopUtils]: For program point L322(lines 322 326) no Hoare annotation was computed. [2021-01-06 11:36:27,857 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 11:36:27,857 INFO L189 CegarLoopUtils]: For program point L322-2(lines 209 543) no Hoare annotation was computed. [2021-01-06 11:36:27,857 INFO L189 CegarLoopUtils]: For program point L190(lines 190 551) no Hoare annotation was computed. [2021-01-06 11:36:27,857 INFO L189 CegarLoopUtils]: For program point L157(lines 157 562) no Hoare annotation was computed. [2021-01-06 11:36:27,857 INFO L189 CegarLoopUtils]: For program point L124(lines 124 573) no Hoare annotation was computed. [2021-01-06 11:36:27,857 INFO L189 CegarLoopUtils]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-01-06 11:36:27,857 INFO L189 CegarLoopUtils]: For program point L91-1(lines 73 611) no Hoare annotation was computed. [2021-01-06 11:36:27,857 INFO L189 CegarLoopUtils]: For program point L521(lines 521 525) no Hoare annotation was computed. [2021-01-06 11:36:27,858 INFO L189 CegarLoopUtils]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2021-01-06 11:36:27,858 INFO L189 CegarLoopUtils]: For program point L389(lines 389 407) no Hoare annotation was computed. [2021-01-06 11:36:27,858 INFO L185 CegarLoopUtils]: At program point L191(lines 187 552) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-01-06 11:36:27,858 INFO L185 CegarLoopUtils]: At program point L158(lines 154 563) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-01-06 11:36:27,858 INFO L185 CegarLoopUtils]: At program point L125(lines 124 573) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-01-06 11:36:27,859 INFO L189 CegarLoopUtils]: For program point L92(lines 92 94) no Hoare annotation was computed. [2021-01-06 11:36:27,859 INFO L189 CegarLoopUtils]: For program point L489(lines 489 492) no Hoare annotation was computed. [2021-01-06 11:36:27,859 INFO L189 CegarLoopUtils]: For program point L390(lines 390 396) no Hoare annotation was computed. [2021-01-06 11:36:27,859 INFO L192 CegarLoopUtils]: At program point L622(lines 613 624) the Hoare annotation is: true [2021-01-06 11:36:27,859 INFO L189 CegarLoopUtils]: For program point L193(lines 193 550) no Hoare annotation was computed. [2021-01-06 11:36:27,859 INFO L189 CegarLoopUtils]: For program point L160(lines 160 561) no Hoare annotation was computed. [2021-01-06 11:36:27,859 INFO L189 CegarLoopUtils]: For program point L127(lines 127 572) no Hoare annotation was computed. [2021-01-06 11:36:27,859 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 11:36:27,859 INFO L189 CegarLoopUtils]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-01-06 11:36:27,860 INFO L189 CegarLoopUtils]: For program point L458(lines 458 460) no Hoare annotation was computed. [2021-01-06 11:36:27,860 INFO L189 CegarLoopUtils]: For program point L260(lines 260 262) no Hoare annotation was computed. [2021-01-06 11:36:27,860 INFO L189 CegarLoopUtils]: For program point L227(lines 227 238) no Hoare annotation was computed. [2021-01-06 11:36:27,860 INFO L189 CegarLoopUtils]: For program point L227-2(lines 209 543) no Hoare annotation was computed. [2021-01-06 11:36:27,860 INFO L189 CegarLoopUtils]: For program point L294(lines 294 298) no Hoare annotation was computed. [2021-01-06 11:36:27,860 INFO L189 CegarLoopUtils]: For program point L294-2(lines 294 298) no Hoare annotation was computed. [2021-01-06 11:36:27,860 INFO L189 CegarLoopUtils]: For program point L427-1(lines 427 435) no Hoare annotation was computed. [2021-01-06 11:36:27,860 INFO L189 CegarLoopUtils]: For program point L229(lines 229 232) no Hoare annotation was computed. [2021-01-06 11:36:27,860 INFO L189 CegarLoopUtils]: For program point L196(lines 196 549) no Hoare annotation was computed. [2021-01-06 11:36:27,860 INFO L189 CegarLoopUtils]: For program point L163(lines 163 560) no Hoare annotation was computed. [2021-01-06 11:36:27,861 INFO L189 CegarLoopUtils]: For program point L130(lines 130 571) no Hoare annotation was computed. [2021-01-06 11:36:27,861 INFO L189 CegarLoopUtils]: For program point L494(lines 494 500) no Hoare annotation was computed. [2021-01-06 11:36:27,861 INFO L185 CegarLoopUtils]: At program point L197(lines 193 550) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5)))) [2021-01-06 11:36:27,861 INFO L185 CegarLoopUtils]: At program point L164(lines 160 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-01-06 11:36:27,861 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 11:36:27,862 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 609) no Hoare annotation was computed. [2021-01-06 11:36:27,862 INFO L189 CegarLoopUtils]: For program point L430(lines 430 433) no Hoare annotation was computed. [2021-01-06 11:36:27,862 INFO L189 CegarLoopUtils]: For program point L331(lines 331 369) no Hoare annotation was computed. [2021-01-06 11:36:27,862 INFO L189 CegarLoopUtils]: For program point L199(lines 199 548) no Hoare annotation was computed. [2021-01-06 11:36:27,862 INFO L189 CegarLoopUtils]: For program point L166(lines 166 559) no Hoare annotation was computed. [2021-01-06 11:36:27,862 INFO L189 CegarLoopUtils]: For program point L133(lines 133 570) no Hoare annotation was computed. [2021-01-06 11:36:27,863 INFO L185 CegarLoopUtils]: At program point L100-2(lines 100 599) the Hoare annotation is: (let ((.cse22 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse26 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (let ((.cse23 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse24 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse25 (not .cse4)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse10 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not .cse26)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse30 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not .cse22)) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse5) (and .cse0 .cse4 .cse6 .cse5) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse9 .cse20) (and .cse0 .cse9 .cse6) (and .cse21 .cse22) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse6 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse23 .cse18 .cse24 .cse25) (and .cse21 .cse26) (and .cse23 .cse20) (and .cse9 .cse18 .cse24) (and .cse7 .cse8 .cse9 .cse17 .cse10 .cse12 .cse6 .cse14 .cse19) (and .cse27 .cse23 .cse14 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse25) (and .cse0 .cse13 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse27 .cse4 .cse14) (and .cse2 .cse9 .cse28 .cse4 .cse24) (and .cse0 .cse2 .cse28 .cse24 .cse29 .cse5) (and .cse1 .cse2 .cse3 .cse25) (and .cse4 .cse26 .cse5) (and .cse0 .cse30 .cse4 .cse5) (and .cse21 .cse2 .cse28 .cse24) (and .cse5 .cse20) (and .cse0 .cse21 .cse6) (and .cse2 .cse28 .cse24 .cse29 .cse5 .cse25) (and .cse21 .cse20) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse4 .cse5) (and .cse4 .cse22 .cse5) (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2021-01-06 11:36:27,863 INFO L189 CegarLoopUtils]: For program point L497(lines 497 499) no Hoare annotation was computed. [2021-01-06 11:36:27,863 INFO L189 CegarLoopUtils]: For program point L497-2(lines 209 543) no Hoare annotation was computed. [2021-01-06 11:36:27,863 INFO L185 CegarLoopUtils]: At program point L398(lines 389 407) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-01-06 11:36:27,863 INFO L189 CegarLoopUtils]: For program point L233(lines 233 236) no Hoare annotation was computed. [2021-01-06 11:36:27,863 INFO L185 CegarLoopUtils]: At program point L167(lines 166 559) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (not .cse2)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3))) [2021-01-06 11:36:27,864 INFO L185 CegarLoopUtils]: At program point L134(lines 127 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-01-06 11:36:27,864 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2021-01-06 11:36:27,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:36:27 BoogieIcfgContainer [2021-01-06 11:36:27,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:36:27,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:36:27,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:36:27,919 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:36:27,919 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:51" (3/4) ... [2021-01-06 11:36:27,923 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 11:36:27,958 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 11:36:27,959 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 11:36:27,960 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:36:27,961 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:36:28,092 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/openssl-simplified/s3_srvr_4.cil.c-witness.graphml [2021-01-06 11:36:28,093 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:36:28,094 INFO L168 Benchmark]: Toolchain (without parser) took 38463.41 ms. Allocated memory was 158.3 MB in the beginning and 995.1 MB in the end (delta: 836.8 MB). Free memory was 134.0 MB in the beginning and 921.3 MB in the end (delta: -787.3 MB). Peak memory consumption was 50.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:28,094 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 158.3 MB. Free memory is still 130.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:36:28,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.79 ms. Allocated memory is still 158.3 MB. Free memory was 133.7 MB in the beginning and 118.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:28,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.33 ms. Allocated memory is still 158.3 MB. Free memory was 118.6 MB in the beginning and 115.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:36:28,095 INFO L168 Benchmark]: Boogie Preprocessor took 42.28 ms. Allocated memory is still 158.3 MB. Free memory was 115.8 MB in the beginning and 113.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:36:28,095 INFO L168 Benchmark]: RCFGBuilder took 1074.56 ms. Allocated memory is still 158.3 MB. Free memory was 113.7 MB in the beginning and 97.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:28,096 INFO L168 Benchmark]: TraceAbstraction took 36504.23 ms. Allocated memory was 158.3 MB in the beginning and 995.1 MB in the end (delta: 836.8 MB). Free memory was 97.4 MB in the beginning and 934.6 MB in the end (delta: -837.2 MB). Peak memory consumption was 562.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:28,096 INFO L168 Benchmark]: Witness Printer took 174.54 ms. Allocated memory is still 995.1 MB. Free memory was 934.6 MB in the beginning and 921.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:28,098 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.21 ms. Allocated memory is still 158.3 MB. Free memory is still 130.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 523.79 ms. Allocated memory is still 158.3 MB. Free memory was 133.7 MB in the beginning and 118.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 132.33 ms. Allocated memory is still 158.3 MB. Free memory was 118.6 MB in the beginning and 115.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 42.28 ms. Allocated memory is still 158.3 MB. Free memory was 115.8 MB in the beginning and 113.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1074.56 ms. Allocated memory is still 158.3 MB. Free memory was 113.7 MB in the beginning and 97.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 36504.23 ms. Allocated memory was 158.3 MB in the beginning and 995.1 MB in the end (delta: 836.8 MB). Free memory was 97.4 MB in the beginning and 934.6 MB in the end (delta: -837.2 MB). Peak memory consumption was 562.2 MB. Max. memory is 8.0 GB. * Witness Printer took 174.54 ms. Allocated memory is still 995.1 MB. Free memory was 934.6 MB in the beginning and 921.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 609]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && s__s3__tmp__next_state___0 <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && s__hit == 0) && 8448 <= s__state) && 2 == blastFlag) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: ((((((((((!(8496 == s__state) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8673) && blastFlag == 0) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8672)) || (((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8673)) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag)) || (((((!(s__state == 8673) && s__state <= 8672) && blastFlag == 1) && s__hit == 0) && 8640 <= s__state) && !(s__state == 8672))) || (((((!(s__state == 8673) && s__state <= 8672) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(s__hit == 0)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8672 <= s__state) || ((s__hit == 0 && s__state == 8512) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__hit == 0) && s__state <= 8576) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (blastFlag == 1 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || (blastFlag == 0 && s__state == 8544)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (blastFlag == 0 && 8560 == s__state)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && s__hit == 0) && 2 == blastFlag)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || ((((s__state <= 8672 && blastFlag == 1) && !(s__state == 8657)) && s__hit == 0) && 8640 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag)) || (((blastFlag <= 3 && s__state <= 8672) && 8672 <= s__state) && !(s__hit == 0))) || ((s__hit == 0 && 8560 == s__state) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8608) && s__hit == 0) && 2 == blastFlag)) || (((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state)) || (2 == blastFlag && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(s__hit == 0))) || (blastFlag == 0 && s__state <= 3)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((s__state == 8528 && s__hit == 0) && 2 == blastFlag)) || ((s__hit == 0 && s__state == 8544) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481)) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && blastFlag == 1) && !(8448 == s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8448) && !(8448 == s__state))) || ((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && !(8448 == s__state)) && s__hit == 0) && 2 == blastFlag) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) && 2 == blastFlag) || (((((s__state <= 8672 && blastFlag == 1) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656))) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) && !(s__hit == 0))) || ((((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) && 2 == blastFlag) && !(s__hit == 0))) || (((((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && !(s__state == 8656)) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) || (((((((((!(s__state == 8545) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8672 <= s__state) || ((s__hit == 0 && s__state == 8512) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__hit == 0) && s__state <= 8576) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (blastFlag == 1 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || (blastFlag == 0 && s__state == 8544)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (blastFlag == 0 && 8560 == s__state)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && s__hit == 0) && 2 == blastFlag)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state)) || ((((s__state <= 8672 && blastFlag == 1) && !(s__state == 8657)) && s__hit == 0) && 8640 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag)) || (((blastFlag <= 3 && s__state <= 8672) && 8672 <= s__state) && !(s__hit == 0))) || ((s__hit == 0 && 8560 == s__state) && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8608) && s__hit == 0) && 2 == blastFlag)) || (((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state)) || (2 == blastFlag && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && !(s__state == 8672)) && 2 == blastFlag) && !(s__hit == 0))) || (blastFlag == 0 && s__state <= 3)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((s__state == 8528 && s__hit == 0) && 2 == blastFlag)) || ((s__hit == 0 && s__state == 8544) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8592) && 8448 <= s__state) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481))) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && blastFlag == 1) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state == 8608) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && !(s__state == 8481)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__state <= 8640) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && s__hit == 0) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || (((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8545)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: ((((((((((!(8496 == s__state) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && s__hit == 0) && 8448 <= s__state) && 2 == blastFlag) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && blastFlag == 1) && 8448 <= s__state)) || ((((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8640) && 8448 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8448) && 8448 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state <= 8448) && s__hit == 0) && 8448 <= s__state) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && s__s3__tmp__next_state___0 <= 8640) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8640) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((((((((!(8496 == s__state) && !(s__state == 8480)) && blastFlag == 1) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__hit == 0) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) && 2 == blastFlag)) || (((((((((!(8496 == s__state) && blastFlag == 0) && !(s__state == 8480)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && 8672 <= s__state) && !(12292 == s__state)) || (((blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state)) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8672 <= s__state) && !(12292 == s__state))) || ((blastFlag == 1 && 8672 <= s__state) && !(12292 == s__state)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && blastFlag == 1) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) || ((((((((((((!(s__state == 8545) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && s__hit == 0) && !(s__state == 8481))) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && blastFlag == 0) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8481)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && s__state == 8608) && s__hit == 0) && 2 == blastFlag) || (blastFlag == 0 && s__state == 8608)) || (blastFlag == 1 && s__state == 8608) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 20.2s, OverallIterations: 35, TraceHistogramMax: 19, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6694 SDtfs, 4128 SDslu, 3183 SDs, 0 SdLazy, 3455 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1999 GetRequests, 1954 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4086occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 4500 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3347 HoareAnnotationTreeSize, 28 FomulaSimplifications, 155193 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 28 FomulaSimplificationsInter, 30432 FormulaSimplificationTreeSizeReductionInter, 13.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 9249 NumberOfCodeBlocks, 9249 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9209 ConstructedInterpolants, 0 QuantifiedInterpolants, 3966998 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3115 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 30536/30750 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...