java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:56:04,866 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:56:04,868 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:56:04,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:56:04,880 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:56:04,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:56:04,883 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:56:04,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:56:04,887 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:56:04,888 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:56:04,889 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:56:04,889 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:56:04,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:56:04,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:56:04,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:56:04,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:56:04,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:56:04,897 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:56:04,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:56:04,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:56:04,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:56:04,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:56:04,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:56:04,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:56:04,907 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:56:04,908 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:56:04,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:56:04,909 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:56:04,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:56:04,911 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:56:04,911 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:56:04,912 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:56:04,913 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:56:04,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:56:04,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:56:04,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:56:04,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:56:04,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:56:04,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX [2019-05-15 10:56:04,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:04,983 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:04,987 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:04,989 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:04,989 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:04,990 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl [2019-05-15 10:56:04,991 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2019-05-15 10:56:05,058 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:05,060 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:05,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:05,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:05,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:05,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:05,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:05,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:05,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:05,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:05,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:05,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:05,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:05,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-05-15 10:56:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:56:05,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:56:05,647 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-05-15 10:56:05,650 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:56:05,650 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-05-15 10:56:05,651 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:05 BoogieIcfgContainer [2019-05-15 10:56:05,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:05,652 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:05,652 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:05,653 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:05,657 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,714 INFO L632 onniauxMapEliminator]: ULTIMATE.startENTRY [2019-05-15 10:56:05,715 INFO L633 onniauxMapEliminator]: In Formula: (and (= (store (store (store (store (store (store (store (store (store (store (store v_ULTIMATE.start_main_~vetor_vogais~5_13 0 97) 1 65) 2 101) 3 69) 4 105) 5 73) 6 111) 7 79) 8 117) 9 85) 10 0) v_ULTIMATE.start_main_~vetor_vogais~5_1) (= v_ULTIMATE.start_main_~i~5_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_1, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~tam_string~5=v_ULTIMATE.start_main_~tam_string~5_1, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~vetor_vogais~5=v_ULTIMATE.start_main_~vetor_vogais~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_1} AuxVars[v_ULTIMATE.start_main_~vetor_vogais~5_13] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~cont~5, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~tam_string~5, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~vetor_vogais~5, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~string_entrada~5] [2019-05-15 10:56:05,716 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (not (= |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_idx_0_1| 10)) (= 0 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_val_0_1|)) (= v_ULTIMATE.start_main_~i~5_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_1, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_out_1, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~vetor_vogais~5_val_0=v_ULTIMATE.start_main_~vetor_vogais~5_val_0_out_1, ULTIMATE.start_main_~tam_string~5=v_ULTIMATE.start_main_~tam_string~5_1, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[|v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_idx_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_val_0_1|] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~string_entrada~5_val_0, ULTIMATE.start_main_~cont~5, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~vetor_vogais~5_val_0, ULTIMATE.start_main_~tam_string~5, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~j~5] [2019-05-15 10:56:05,716 INFO L635 onniauxMapEliminator]: L63 [2019-05-15 10:56:05,734 INFO L632 onniauxMapEliminator]: L63 [2019-05-15 10:56:05,735 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_ULTIMATE.start_main_~string_entrada~5_5 (store v_ULTIMATE.start_main_~string_entrada~5_6 9 0)) (not (< (mod v_ULTIMATE.start_main_~i~5_6 4294967296) 10)) (= v_ULTIMATE.start_main_~n_caracter~5_4 0)) InVars {ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_6, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} OutVars{ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_4, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_5, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_~string_entrada~5] [2019-05-15 10:56:05,735 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_2 9)) (= v_ULTIMATE.start_main_~n_caracter~5_4 0) (not (< (mod v_ULTIMATE.start_main_~i~5_6 4294967296) 10)) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (or (not (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_2 9)) (= 0 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_1)) (= v_ULTIMATE.start_main_~string_entrada~5_val_0_out_2 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_1)) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_2, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_2, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_4, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_out_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_~string_entrada~5_val_0] [2019-05-15 10:56:05,736 INFO L635 onniauxMapEliminator]: L83 [2019-05-15 10:56:05,752 INFO L632 onniauxMapEliminator]: L63 [2019-05-15 10:56:05,753 INFO L633 onniauxMapEliminator]: In Formula: (and (= (+ v_ULTIMATE.start_main_~i~5_9 1) v_ULTIMATE.start_main_~i~5_8) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet1_3| 128)) (< (mod v_ULTIMATE.start_main_~i~5_9 4294967296) 10) (= v_ULTIMATE.start_main_~string_entrada~5_8 (store v_ULTIMATE.start_main_~string_entrada~5_9 (mod v_ULTIMATE.start_main_~i~5_9 4294967296) |v_ULTIMATE.start_main_#t~nondet1_3|)) (<= |v_ULTIMATE.start_main_#t~nondet1_3| 127)) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_9, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_9} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_~string_entrada~5] [2019-05-15 10:56:05,753 INFO L634 onniauxMapEliminator]: Out Formula: (and (= (+ v_ULTIMATE.start_main_~i~5_9 1) v_ULTIMATE.start_main_~i~5_8) (= v_ULTIMATE.start_main_~string_entrada~5_val_0_out_3 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_2) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet1_3| 128)) (< (mod v_ULTIMATE.start_main_~i~5_9 4294967296) 10) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_3 (mod v_ULTIMATE.start_main_~i~5_9 4294967296))) (or (not (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_3 (mod v_ULTIMATE.start_main_~i~5_9 4294967296))) (= v_ULTIMATE.start_main_~string_entrada~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet1_3|)) (<= |v_ULTIMATE.start_main_#t~nondet1_3| 127)) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_3, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_9} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_3, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_out_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~string_entrada~5_val_0, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:05,753 INFO L635 onniauxMapEliminator]: L63 [2019-05-15 10:56:05,762 INFO L632 onniauxMapEliminator]: L83 [2019-05-15 10:56:05,762 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_ULTIMATE.start_main_~cont_aux~5_3 0) (<= (mod v_ULTIMATE.start_main_~n_caracter~5_5 4294967296) 0) (= v_ULTIMATE.start_main_~cont~5_5 0) (= 0 (select v_ULTIMATE.start_main_~string_entrada~5_10 (mod v_ULTIMATE.start_main_~n_caracter~5_5 4294967296))) (= v_ULTIMATE.start_main_~i~5_10 0)) InVars {ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_5, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_10} OutVars{ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_3, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_5, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_5, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start_main_~cont~5, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:05,763 INFO L634 onniauxMapEliminator]: Out Formula: (and (= v_ULTIMATE.start_main_~cont_aux~5_3 0) (<= (mod v_ULTIMATE.start_main_~n_caracter~5_5 4294967296) 0) (= v_ULTIMATE.start_main_~cont~5_5 0) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_4 (mod v_ULTIMATE.start_main_~n_caracter~5_5 4294967296))) (or (= v_v_ULTIMATE.start_main_~string_entrada~5_10_aux_1 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_3) (not (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_4 (mod v_ULTIMATE.start_main_~n_caracter~5_5 4294967296)))) (= v_ULTIMATE.start_main_~i~5_10 0) (= v_v_ULTIMATE.start_main_~string_entrada~5_10_aux_1 0)) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_4, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_5, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_3} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_4, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_3, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_5, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_3, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_5, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10} AuxVars[v_v_ULTIMATE.start_main_~string_entrada~5_10_aux_1] AssignedVars[ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start_main_~cont~5, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:05,763 INFO L635 onniauxMapEliminator]: L113 [2019-05-15 10:56:05,774 INFO L632 onniauxMapEliminator]: L83 [2019-05-15 10:56:05,775 INFO L633 onniauxMapEliminator]: In Formula: (and (not (= (select v_ULTIMATE.start_main_~string_entrada~5_11 (mod v_ULTIMATE.start_main_~n_caracter~5_7 4294967296)) 0)) (= (+ v_ULTIMATE.start_main_~n_caracter~5_7 1) v_ULTIMATE.start_main_~n_caracter~5_6)) InVars {ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_7, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_11} OutVars{ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_6, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_#t~post2] [2019-05-15 10:56:05,775 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_5 (mod v_ULTIMATE.start_main_~n_caracter~5_7 4294967296))) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (or (= v_v_ULTIMATE.start_main_~string_entrada~5_11_aux_1 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_4) (not (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_5 (mod v_ULTIMATE.start_main_~n_caracter~5_7 4294967296)))) (not (= v_v_ULTIMATE.start_main_~string_entrada~5_11_aux_1 0)) (= (+ v_ULTIMATE.start_main_~n_caracter~5_7 1) v_ULTIMATE.start_main_~n_caracter~5_6)) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_5, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_7, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_4} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_5, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_6, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_4} AuxVars[v_v_ULTIMATE.start_main_~string_entrada~5_11_aux_1] AssignedVars[ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_#t~post2] [2019-05-15 10:56:05,776 INFO L635 onniauxMapEliminator]: L83 [2019-05-15 10:56:05,791 INFO L632 onniauxMapEliminator]: L113 [2019-05-15 10:56:05,791 INFO L633 onniauxMapEliminator]: In Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (= (mod v_ULTIMATE.start_main_~cont_aux~5_2 4294967296) (mod v_ULTIMATE.start_main_~cont~5_4 4294967296)) 1 0)) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= (select v_ULTIMATE.start_main_~string_entrada~5_4 (mod v_ULTIMATE.start_main_~i~5_5 4294967296)) 0)) InVars {ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_2, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_4, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_5} OutVars{ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_2, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_4, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_5} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-05-15 10:56:05,792 INFO L634 onniauxMapEliminator]: Out Formula: (and (= 0 v_v_ULTIMATE.start_main_~string_entrada~5_4_aux_1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (= (mod v_ULTIMATE.start_main_~cont_aux~5_2 4294967296) (mod v_ULTIMATE.start_main_~cont~5_4 4294967296)) 1 0)) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (or (not (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_6 (mod v_ULTIMATE.start_main_~i~5_5 4294967296))) (= v_ULTIMATE.start_main_~string_entrada~5_val_0_in_5 v_v_ULTIMATE.start_main_~string_entrada~5_4_aux_1)) (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_6 (mod v_ULTIMATE.start_main_~i~5_5 4294967296)))) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_6, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_2, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_5, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_5} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_6, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_2, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_5, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_5} AuxVars[v_v_ULTIMATE.start_main_~string_entrada~5_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-05-15 10:56:05,792 INFO L635 onniauxMapEliminator]: L96 [2019-05-15 10:56:05,807 INFO L632 onniauxMapEliminator]: L113 [2019-05-15 10:56:05,808 INFO L633 onniauxMapEliminator]: In Formula: (and (not (= 0 (select v_ULTIMATE.start_main_~string_entrada~5_7 (mod v_ULTIMATE.start_main_~i~5_7 4294967296)))) (= v_ULTIMATE.start_main_~j~5_4 0)) InVars {ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_7, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7} OutVars{ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_7, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~5] [2019-05-15 10:56:05,808 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (not (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_7 (mod v_ULTIMATE.start_main_~i~5_7 4294967296))) (= v_v_ULTIMATE.start_main_~string_entrada~5_7_aux_1 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_6)) (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_7 (mod v_ULTIMATE.start_main_~i~5_7 4294967296))) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (not (= v_v_ULTIMATE.start_main_~string_entrada~5_7_aux_1 0)) (= v_ULTIMATE.start_main_~j~5_4 0)) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_7, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_6, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_7, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_6, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7} AuxVars[v_v_ULTIMATE.start_main_~string_entrada~5_7_aux_1] AssignedVars[ULTIMATE.start_main_~j~5] [2019-05-15 10:56:05,808 INFO L635 onniauxMapEliminator]: L123 [2019-05-15 10:56:05,831 INFO L632 onniauxMapEliminator]: L123 [2019-05-15 10:56:05,831 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_ULTIMATE.start_main_~cont_aux~5_4 (+ v_ULTIMATE.start_main_~cont_aux~5_5 1)) (< (mod v_ULTIMATE.start_main_~j~5_7 4294967296) 10) (= (+ v_ULTIMATE.start_main_~j~5_7 1) v_ULTIMATE.start_main_~j~5_6) (= (select v_ULTIMATE.start_main_~string_entrada~5_12 (mod v_ULTIMATE.start_main_~i~5_14 4294967296)) (select v_ULTIMATE.start_main_~vetor_vogais~5_14 (mod v_ULTIMATE.start_main_~j~5_7 4294967296)))) InVars {ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_5, ULTIMATE.start_main_~vetor_vogais~5=v_ULTIMATE.start_main_~vetor_vogais~5_14, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_7, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_12, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_14} OutVars{ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_4, ULTIMATE.start_main_~vetor_vogais~5=v_ULTIMATE.start_main_~vetor_vogais~5_14, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_2|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_6, ULTIMATE.start_main_~string_entrada~5=v_ULTIMATE.start_main_~string_entrada~5_12, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~5] [2019-05-15 10:56:05,832 INFO L634 onniauxMapEliminator]: Out Formula: (and (= v_ULTIMATE.start_main_~cont_aux~5_4 (+ v_ULTIMATE.start_main_~cont_aux~5_5 1)) (< (mod v_ULTIMATE.start_main_~j~5_7 4294967296) 10) (= (+ v_ULTIMATE.start_main_~j~5_7 1) v_ULTIMATE.start_main_~j~5_6) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 v_ULTIMATE.start_main_~vetor_vogais~5_idx_0_term_assigned_1 (= v_v_ULTIMATE.start_main_~string_entrada~5_12_aux_1 v_v_ULTIMATE.start_main_~vetor_vogais~5_14_aux_1) (or (not v_ULTIMATE.start_main_~vetor_vogais~5_idx_0_term_assigned_1) (= (mod v_ULTIMATE.start_main_~i~5_14 4294967296) v_ULTIMATE.start_main_~vetor_vogais~5_idx_0_term_8) (= v_ULTIMATE.start_main_~vetor_vogais~5_idx_0_term_8 (mod v_ULTIMATE.start_main_~j~5_7 4294967296))) (or (= v_v_ULTIMATE.start_main_~vetor_vogais~5_14_aux_1 v_ULTIMATE.start_main_~vetor_vogais~5_val_0_in_1) (not (= v_ULTIMATE.start_main_~vetor_vogais~5_idx_0_term_8 (mod v_ULTIMATE.start_main_~j~5_7 4294967296)))) (or (= v_v_ULTIMATE.start_main_~string_entrada~5_12_aux_1 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_7) (not (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_8 (mod v_ULTIMATE.start_main_~i~5_14 4294967296)))) (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_8 (mod v_ULTIMATE.start_main_~i~5_14 4294967296)) (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_8 (mod v_ULTIMATE.start_main_~j~5_7 4294967296)))) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_8, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_5, ULTIMATE.start_main_~vetor_vogais~5_idx_0=v_ULTIMATE.start_main_~vetor_vogais~5_idx_0_term_8, ULTIMATE.start_main_~vetor_vogais~5_val_0=v_ULTIMATE.start_main_~vetor_vogais~5_val_0_in_1, ULTIMATE.start_main_~vetor_vogais~5_idx_0_bool=v_ULTIMATE.start_main_~vetor_vogais~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_7, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_7, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_14} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_8, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_4, ULTIMATE.start_main_~vetor_vogais~5_idx_0=v_ULTIMATE.start_main_~vetor_vogais~5_idx_0_term_8, ULTIMATE.start_main_~vetor_vogais~5_val_0=v_ULTIMATE.start_main_~vetor_vogais~5_val_0_in_1, ULTIMATE.start_main_~vetor_vogais~5_idx_0_bool=v_ULTIMATE.start_main_~vetor_vogais~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_2|, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_7, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_6, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_14} AuxVars[v_v_ULTIMATE.start_main_~string_entrada~5_12_aux_1, v_v_ULTIMATE.start_main_~vetor_vogais~5_14_aux_1] AssignedVars[ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~5] [2019-05-15 10:56:05,832 INFO L635 onniauxMapEliminator]: L123 [2019-05-15 10:56:05,844 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:05 BasicIcfg [2019-05-15 10:56:05,844 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:05,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:05,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:05,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:05,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/3) ... [2019-05-15 10:56:05,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44130b2c and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:56:05, skipping insertion in model container [2019-05-15 10:56:05,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:05" (2/3) ... [2019-05-15 10:56:05,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44130b2c and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:05, skipping insertion in model container [2019-05-15 10:56:05,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:05" (3/3) ... [2019-05-15 10:56:05,853 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bplME [2019-05-15 10:56:05,861 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:05,868 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:56:05,885 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:56:05,914 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:05,915 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:05,915 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:05,915 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:05,915 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:05,915 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:05,916 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:05,916 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:05,916 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-05-15 10:56:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:56:05,938 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:05,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-05-15 10:56:05,944 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash 61108357, now seen corresponding path program 1 times [2019-05-15 10:56:05,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:56:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:06,163 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} [34] ULTIMATE.startENTRY-->L63: Formula: (and (or (not (= |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_idx_0_1| 10)) (= 0 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_val_0_1|)) (= v_ULTIMATE.start_main_~i~5_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_1, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_out_1, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~vetor_vogais~5_val_0=v_ULTIMATE.start_main_~vetor_vogais~5_val_0_out_1, ULTIMATE.start_main_~tam_string~5=v_ULTIMATE.start_main_~tam_string~5_1, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[|v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_idx_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_val_0_1|] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~string_entrada~5_val_0, ULTIMATE.start_main_~cont~5, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~vetor_vogais~5_val_0, ULTIMATE.start_main_~tam_string~5, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~j~5] {15#(= ULTIMATE.start_main_~i~5 0)} is VALID [2019-05-15 10:56:06,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {15#(= ULTIMATE.start_main_~i~5 0)} [35] L63-->L83: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_2 9))) (and (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) .cse0) (= v_ULTIMATE.start_main_~n_caracter~5_4 0) (not (< (mod v_ULTIMATE.start_main_~i~5_6 4294967296) 10)) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (or (not .cse0) (= 0 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_1)) (= v_ULTIMATE.start_main_~string_entrada~5_val_0_out_2 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_1))) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_2, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_2, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_4, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_out_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_~string_entrada~5_val_0] {11#false} is VALID [2019-05-15 10:56:06,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {11#false} [37] L83-->L113: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~n_caracter~5_5 4294967296))) (let ((.cse1 (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_4 .cse0))) (and (= v_ULTIMATE.start_main_~cont_aux~5_3 0) (<= .cse0 0) (= v_ULTIMATE.start_main_~cont~5_5 0) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) .cse1) (or (= v_v_ULTIMATE.start_main_~string_entrada~5_10_aux_1 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_3) (not .cse1)) (= v_ULTIMATE.start_main_~i~5_10 0) (= v_v_ULTIMATE.start_main_~string_entrada~5_10_aux_1 0)))) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_4, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_5, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_3} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_4, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_3, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_5, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_3, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_5, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10} AuxVars[v_v_ULTIMATE.start_main_~string_entrada~5_10_aux_1] AssignedVars[ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start_main_~cont~5, ULTIMATE.start_main_~i~5] {11#false} is VALID [2019-05-15 10:56:06,166 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} [39] L113-->L96: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_6 (mod v_ULTIMATE.start_main_~i~5_5 4294967296)))) (and (= 0 v_v_ULTIMATE.start_main_~string_entrada~5_4_aux_1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (= (mod v_ULTIMATE.start_main_~cont_aux~5_2 4294967296) (mod v_ULTIMATE.start_main_~cont~5_4 4294967296)) 1 0)) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (or (not .cse0) (= v_ULTIMATE.start_main_~string_entrada~5_val_0_in_5 v_v_ULTIMATE.start_main_~string_entrada~5_4_aux_1)) (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) .cse0))) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_6, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_2, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_5, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_5} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_6, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_2, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_5, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_5} AuxVars[v_v_ULTIMATE.start_main_~string_entrada~5_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {11#false} is VALID [2019-05-15 10:56:06,167 INFO L273 TraceCheckUtils]: 4: Hoare triple {11#false} [41] L96-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11#false} is VALID [2019-05-15 10:56:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:06,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:06,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:56:06,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-05-15 10:56:06,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:06,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:06,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:06,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:06,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:06,221 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-05-15 10:56:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,557 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-05-15 10:56:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:06,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-05-15 10:56:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-05-15 10:56:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-05-15 10:56:06,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2019-05-15 10:56:06,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,637 INFO L225 Difference]: With dead ends: 12 [2019-05-15 10:56:06,637 INFO L226 Difference]: Without dead ends: 12 [2019-05-15 10:56:06,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-05-15 10:56:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-05-15 10:56:06,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:06,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 8 states. [2019-05-15 10:56:06,669 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 8 states. [2019-05-15 10:56:06,669 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 8 states. [2019-05-15 10:56:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,672 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-05-15 10:56:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-05-15 10:56:06,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,673 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states. [2019-05-15 10:56:06,673 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states. [2019-05-15 10:56:06,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,675 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-05-15 10:56:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-05-15 10:56:06,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:06,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:56:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-05-15 10:56:06,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-05-15 10:56:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:06,680 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-05-15 10:56:06,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-05-15 10:56:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-05-15 10:56:06,681 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:06,681 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-05-15 10:56:06,681 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:06,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:06,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1895221063, now seen corresponding path program 1 times [2019-05-15 10:56:06,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-15 10:56:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:06,829 INFO L273 TraceCheckUtils]: 0: Hoare triple {71#true} [34] ULTIMATE.startENTRY-->L63: Formula: (and (or (not (= |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_idx_0_1| 10)) (= 0 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_val_0_1|)) (= v_ULTIMATE.start_main_~i~5_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_1, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_out_1, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~vetor_vogais~5_val_0=v_ULTIMATE.start_main_~vetor_vogais~5_val_0_out_1, ULTIMATE.start_main_~tam_string~5=v_ULTIMATE.start_main_~tam_string~5_1, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[|v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_idx_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~vetor_vogais~5_13_0_97)_1BAR_1_65)_1BAR_2_101)_1BAR_3_69)_1BAR_4_105)_1BAR_5_73)_1BAR_6_111)_1BAR_7_79)_1BAR_8_117)_1BAR_9_85)_1_val_0_1|] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~string_entrada~5_val_0, ULTIMATE.start_main_~cont~5, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~vetor_vogais~5_val_0, ULTIMATE.start_main_~tam_string~5, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~j~5] {76#(= ULTIMATE.start_main_~i~5 0)} is VALID [2019-05-15 10:56:06,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {76#(= ULTIMATE.start_main_~i~5 0)} [36] L63-->L63: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~i~5_9 4294967296))) (let ((.cse1 (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_3 .cse0))) (and (= (+ v_ULTIMATE.start_main_~i~5_9 1) v_ULTIMATE.start_main_~i~5_8) (= v_ULTIMATE.start_main_~string_entrada~5_val_0_out_3 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_2) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet1_3| 128)) (< .cse0 10) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) .cse1) (or (not .cse1) (= v_ULTIMATE.start_main_~string_entrada~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet1_3|)) (<= |v_ULTIMATE.start_main_#t~nondet1_3| 127)))) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_3, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_9} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_3, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_out_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~string_entrada~5_val_0, ULTIMATE.start_main_~i~5] {80#(and ULTIMATE.start_main_~string_entrada~5_idx_0_bool (= ULTIMATE.start_main_~string_entrada~5_idx_0 0))} is VALID [2019-05-15 10:56:06,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {80#(and ULTIMATE.start_main_~string_entrada~5_idx_0_bool (= ULTIMATE.start_main_~string_entrada~5_idx_0 0))} [35] L63-->L83: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_2 9))) (and (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) .cse0) (= v_ULTIMATE.start_main_~n_caracter~5_4 0) (not (< (mod v_ULTIMATE.start_main_~i~5_6 4294967296) 10)) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (or (not .cse0) (= 0 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_1)) (= v_ULTIMATE.start_main_~string_entrada~5_val_0_out_2 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_1))) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_2, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_2, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_4, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_out_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_~string_entrada~5_val_0] {72#false} is VALID [2019-05-15 10:56:06,854 INFO L273 TraceCheckUtils]: 3: Hoare triple {72#false} [37] L83-->L113: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~n_caracter~5_5 4294967296))) (let ((.cse1 (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_4 .cse0))) (and (= v_ULTIMATE.start_main_~cont_aux~5_3 0) (<= .cse0 0) (= v_ULTIMATE.start_main_~cont~5_5 0) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) .cse1) (or (= v_v_ULTIMATE.start_main_~string_entrada~5_10_aux_1 v_ULTIMATE.start_main_~string_entrada~5_val_0_in_3) (not .cse1)) (= v_ULTIMATE.start_main_~i~5_10 0) (= v_v_ULTIMATE.start_main_~string_entrada~5_10_aux_1 0)))) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_4, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_5, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_3} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_4, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_3, ULTIMATE.start_main_~n_caracter~5=v_ULTIMATE.start_main_~n_caracter~5_5, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_3, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_5, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10} AuxVars[v_v_ULTIMATE.start_main_~string_entrada~5_10_aux_1] AssignedVars[ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start_main_~cont~5, ULTIMATE.start_main_~i~5] {72#false} is VALID [2019-05-15 10:56:06,854 INFO L273 TraceCheckUtils]: 4: Hoare triple {72#false} [39] L113-->L96: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_6 (mod v_ULTIMATE.start_main_~i~5_5 4294967296)))) (and (= 0 v_v_ULTIMATE.start_main_~string_entrada~5_4_aux_1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (= (mod v_ULTIMATE.start_main_~cont_aux~5_2 4294967296) (mod v_ULTIMATE.start_main_~cont~5_4 4294967296)) 1 0)) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1 (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (or (not .cse0) (= v_ULTIMATE.start_main_~string_entrada~5_val_0_in_5 v_v_ULTIMATE.start_main_~string_entrada~5_4_aux_1)) (or (not v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1) .cse0))) InVars {ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_6, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_2, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_5, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_5} OutVars{ULTIMATE.start_main_~string_entrada~5_idx_0=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_6, ULTIMATE.start_main_~cont_aux~5=v_ULTIMATE.start_main_~cont_aux~5_2, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~string_entrada~5_idx_0_bool=v_ULTIMATE.start_main_~string_entrada~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_entrada~5_val_0=v_ULTIMATE.start_main_~string_entrada~5_val_0_in_5, ULTIMATE.start_main_~cont~5=v_ULTIMATE.start_main_~cont~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_5} AuxVars[v_v_ULTIMATE.start_main_~string_entrada~5_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {72#false} is VALID [2019-05-15 10:56:06,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {72#false} [41] L96-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72#false} is VALID [2019-05-15 10:56:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:06,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:56:06,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-15 10:56:06,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-05-15 10:56:06,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:06,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:56:06,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:56:06,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:56:06,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:06,940 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2019-05-15 10:56:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,083 INFO L93 Difference]: Finished difference Result 3 states and 3 transitions. [2019-05-15 10:56:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:56:07,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-05-15 10:56:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-15 10:56:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-15 10:56:07,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4 transitions. [2019-05-15 10:56:07,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:07,119 INFO L225 Difference]: With dead ends: 3 [2019-05-15 10:56:07,119 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:56:07,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:56:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:56:07,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:07,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,123 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,124 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,124 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:07,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:07,126 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,126 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,127 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:07,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:07,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:07,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:56:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:56:07,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-05-15 10:56:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:07,130 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:56:07,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:56:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:07,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,134 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:07,136 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:07 BasicIcfg [2019-05-15 10:56:07,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:07,140 INFO L168 Benchmark]: Toolchain (without parser) took 2080.98 ms. Allocated memory was 140.0 MB in the beginning and 176.7 MB in the end (delta: 36.7 MB). Free memory was 109.3 MB in the beginning and 119.6 MB in the end (delta: -10.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,142 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:07,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.96 ms. Allocated memory is still 140.0 MB. Free memory was 109.3 MB in the beginning and 107.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,145 INFO L168 Benchmark]: Boogie Preprocessor took 25.68 ms. Allocated memory is still 140.0 MB. Free memory was 107.6 MB in the beginning and 106.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,146 INFO L168 Benchmark]: RCFGBuilder took 520.98 ms. Allocated memory is still 140.0 MB. Free memory was 106.4 MB in the beginning and 91.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,147 INFO L168 Benchmark]: IcfgTransformer took 192.04 ms. Allocated memory is still 140.0 MB. Free memory was 91.7 MB in the beginning and 83.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,150 INFO L168 Benchmark]: TraceAbstraction took 1291.01 ms. Allocated memory was 140.0 MB in the beginning and 176.7 MB in the end (delta: 36.7 MB). Free memory was 83.5 MB in the beginning and 119.6 MB in the end (delta: -36.1 MB). Peak memory consumption was 587.3 kB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,158 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.96 ms. Allocated memory is still 140.0 MB. Free memory was 109.3 MB in the beginning and 107.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.68 ms. Allocated memory is still 140.0 MB. Free memory was 107.6 MB in the beginning and 106.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 520.98 ms. Allocated memory is still 140.0 MB. Free memory was 106.4 MB in the beginning and 91.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * IcfgTransformer took 192.04 ms. Allocated memory is still 140.0 MB. Free memory was 91.7 MB in the beginning and 83.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1291.01 ms. Allocated memory was 140.0 MB in the beginning and 176.7 MB in the end (delta: 36.7 MB). Free memory was 83.5 MB in the beginning and 119.6 MB in the end (delta: -36.1 MB). Peak memory consumption was 587.3 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 1.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 5 SDslu, 8 SDs, 0 SdLazy, 22 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 79 SizeOfPredicates, 3 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...