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/string.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:56:04,080 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:56:04,082 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:56:04,094 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:56:04,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:56:04,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:56:04,097 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:56:04,099 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:56:04,103 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:56:04,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:56:04,111 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:56:04,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:56:04,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:56:04,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:56:04,121 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:56:04,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:56:04,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:56:04,124 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:56:04,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:56:04,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:56:04,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:56:04,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:56:04,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:56:04,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:56:04,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:56:04,142 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:56:04,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:56:04,144 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:56:04,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:56:04,144 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:56:04,145 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:56:04,146 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:56:04,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:56:04,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:56:04,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:56:04,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:56:04,148 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:56:04,149 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:56:04,150 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,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:04,192 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:04,197 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:04,203 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:04,203 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:04,204 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl [2019-05-15 10:56:04,205 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl' [2019-05-15 10:56:04,273 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:04,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:04,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:04,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:04,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:04,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:04,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:04,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:04,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:04,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:04,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:04,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:04,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:04,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (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:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:56:04,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:56:04,852 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:56:04,853 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-05-15 10:56:04,854 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:04 BoogieIcfgContainer [2019-05-15 10:56:04,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:04,860 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:04,860 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:04,861 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:04,864 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,928 INFO L632 onniauxMapEliminator]: L52 [2019-05-15 10:56:04,929 INFO L633 onniauxMapEliminator]: In Formula: (and (= 0 (select v_ULTIMATE.start_main_~string_A~5_4 4)) (= v_ULTIMATE.start_main_~i~5_6 0) (not (< v_ULTIMATE.start_main_~i~5_7 5))) InVars {ULTIMATE.start_main_~string_A~5=v_ULTIMATE.start_main_~string_A~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7} OutVars{ULTIMATE.start_main_~string_A~5=v_ULTIMATE.start_main_~string_A~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~5] [2019-05-15 10:56:04,929 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_1 4) (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) (or (= v_v_ULTIMATE.start_main_~string_A~5_4_aux_1 v_ULTIMATE.start_main_~string_A~5_val_0_in_1) (not (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_1 4))) (= v_v_ULTIMATE.start_main_~string_A~5_4_aux_1 0) (= v_ULTIMATE.start_main_~i~5_6 0) (not (< v_ULTIMATE.start_main_~i~5_7 5)) v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_1, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7} OutVars{ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_1, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} AuxVars[v_v_ULTIMATE.start_main_~string_A~5_4_aux_1] AssignedVars[ULTIMATE.start_main_~i~5] [2019-05-15 10:56:04,930 INFO L635 onniauxMapEliminator]: L87 [2019-05-15 10:56:04,950 INFO L632 onniauxMapEliminator]: L52 [2019-05-15 10:56:04,951 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)) (< v_ULTIMATE.start_main_~i~5_9 5) (= v_ULTIMATE.start_main_~string_A~5_5 (store v_ULTIMATE.start_main_~string_A~5_6 v_ULTIMATE.start_main_~i~5_9 |v_ULTIMATE.start_main_#t~nondet1_3|)) (<= |v_ULTIMATE.start_main_#t~nondet1_3| 127)) InVars {ULTIMATE.start_main_~string_A~5=v_ULTIMATE.start_main_~string_A~5_6, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_9} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~string_A~5=v_ULTIMATE.start_main_~string_A~5_5, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~string_A~5, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:04,951 INFO L634 onniauxMapEliminator]: Out 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)) (or (not (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_2 v_ULTIMATE.start_main_~i~5_9)) (= v_ULTIMATE.start_main_~string_A~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet1_3|)) (< v_ULTIMATE.start_main_~i~5_9 5) (or (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_2 v_ULTIMATE.start_main_~i~5_9) (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) (= v_ULTIMATE.start_main_~string_A~5_val_0_out_1 v_ULTIMATE.start_main_~string_A~5_val_0_in_2) (<= |v_ULTIMATE.start_main_#t~nondet1_3| 127) v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_2, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_9} OutVars{ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_2, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_out_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~string_A~5_val_0, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:04,951 INFO L635 onniauxMapEliminator]: L52 [2019-05-15 10:56:04,967 INFO L632 onniauxMapEliminator]: L87 [2019-05-15 10:56:04,968 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~j~5_4) (not (< v_ULTIMATE.start_main_~i~5_11 5)) (= 0 (select v_ULTIMATE.start_main_~string_A~5_7 v_ULTIMATE.start_main_~nc_A~5_4)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= 0 (select v_ULTIMATE.start_main_~string_B~5_4 v_ULTIMATE.start_main_~nc_B~5_4)) (or (not (< v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~nc_A~5_4)) (not (< v_ULTIMATE.start_main_~j~5_4 v_ULTIMATE.start_main_~nc_B~5_4))) (= v_ULTIMATE.start_main_~j~5_4 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (or (= 0 v_ULTIMATE.start_main_~found~5_4) (= 1 v_ULTIMATE.start_main_~found~5_4)) 1 0)) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= (select v_ULTIMATE.start_main_~string_B~5_4 4) 0) (= v_ULTIMATE.start_main_~nc_A~5_4 0) (= v_ULTIMATE.start_main_~nc_B~5_4 0) (<= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~nc_B~5_4)) InVars {ULTIMATE.start_main_~string_A~5=v_ULTIMATE.start_main_~string_A~5_7, ULTIMATE.start_main_~string_B~5=v_ULTIMATE.start_main_~string_B~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_11} OutVars{ULTIMATE.start_main_~nc_B~5=v_ULTIMATE.start_main_~nc_B~5_4, ULTIMATE.start_main_~string_A~5=v_ULTIMATE.start_main_~string_A~5_7, ULTIMATE.start_main_~nc_A~5=v_ULTIMATE.start_main_~nc_A~5_4, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~found~5=v_ULTIMATE.start_main_~found~5_4, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~string_B~5=v_ULTIMATE.start_main_~string_B~5_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~nc_B~5, ULTIMATE.start_main_~nc_A~5, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_~found~5, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:04,969 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (and (= v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~j~5_4) (or (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_B~5_4) (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_A~5_4) (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 4)) (not (< v_ULTIMATE.start_main_~i~5_11 5)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (not (< v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~nc_A~5_4)) (= 0 v_v_ULTIMATE.start_main_~string_B~5_4_aux_2) (= v_ULTIMATE.start_main_~j~5_4 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (or (= 0 v_ULTIMATE.start_main_~found~5_4) (= 1 v_ULTIMATE.start_main_~found~5_4)) 1 0)) v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1 (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= 0 v_v_ULTIMATE.start_main_~string_B~5_4_aux_1) (= v_ULTIMATE.start_main_~nc_A~5_4 0) (= v_ULTIMATE.start_main_~nc_B~5_4 0) (or (not v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3) (= 4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3) (= v_ULTIMATE.start_main_~nc_B~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3)) (= 0 v_v_ULTIMATE.start_main_~string_A~5_7_aux_1) (<= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~nc_B~5_4) v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) (and (= v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~j~5_4) (or (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_B~5_4) (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_A~5_4) (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 4)) (not (< v_ULTIMATE.start_main_~i~5_11 5)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (= 0 v_v_ULTIMATE.start_main_~string_B~5_4_aux_2) (= v_ULTIMATE.start_main_~j~5_4 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (or (= 0 v_ULTIMATE.start_main_~found~5_4) (= 1 v_ULTIMATE.start_main_~found~5_4)) 1 0)) v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1 (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= 0 v_v_ULTIMATE.start_main_~string_B~5_4_aux_1) (= v_ULTIMATE.start_main_~nc_A~5_4 0) (not (< v_ULTIMATE.start_main_~j~5_4 v_ULTIMATE.start_main_~nc_B~5_4)) (= v_ULTIMATE.start_main_~nc_B~5_4 0) (or (not v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3) (= 4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3) (= v_ULTIMATE.start_main_~nc_B~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3)) (= 0 v_v_ULTIMATE.start_main_~string_A~5_7_aux_1) (<= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~nc_B~5_4) v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) (or (= v_ULTIMATE.start_main_~string_A~5_val_0_in_3 v_v_ULTIMATE.start_main_~string_A~5_7_aux_1) (not (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_A~5_4))) (or (not (= 4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3)) (= v_ULTIMATE.start_main_~string_B~5_val_0_in_1 v_v_ULTIMATE.start_main_~string_B~5_4_aux_2)) (or (= v_ULTIMATE.start_main_~string_B~5_val_0_in_1 v_v_ULTIMATE.start_main_~string_B~5_4_aux_1) (not (= v_ULTIMATE.start_main_~nc_B~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3)))) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_3, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_11, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start_main_~nc_A~5=v_ULTIMATE.start_main_~nc_A~5_4, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_3, ULTIMATE.start_main_~found~5=v_ULTIMATE.start_main_~found~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1, ULTIMATE.start_main_~nc_B~5=v_ULTIMATE.start_main_~nc_B~5_4, ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_3, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_1} AuxVars[v_v_ULTIMATE.start_main_~string_B~5_4_aux_1, v_v_ULTIMATE.start_main_~string_B~5_4_aux_2, v_v_ULTIMATE.start_main_~string_A~5_7_aux_1] AssignedVars[ULTIMATE.start_main_~nc_B~5, ULTIMATE.start_main_~nc_A~5, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_~found~5, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:04,969 INFO L635 onniauxMapEliminator]: L78 [2019-05-15 10:56:04,987 INFO L632 onniauxMapEliminator]: L87 [2019-05-15 10:56:04,987 INFO L633 onniauxMapEliminator]: In Formula: (and (= (+ v_ULTIMATE.start_main_~i~5_13 1) v_ULTIMATE.start_main_~i~5_12) (<= |v_ULTIMATE.start_main_#t~nondet3_3| 127) (< v_ULTIMATE.start_main_~i~5_13 5) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3_3| 128)) (= v_ULTIMATE.start_main_~string_B~5_5 (store v_ULTIMATE.start_main_~string_B~5_6 v_ULTIMATE.start_main_~i~5_13 |v_ULTIMATE.start_main_#t~nondet3_3|))) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~string_B~5=v_ULTIMATE.start_main_~string_B~5_6, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_13} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~string_B~5=v_ULTIMATE.start_main_~string_B~5_5, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~string_B~5, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:04,988 INFO L634 onniauxMapEliminator]: Out Formula: (and (= v_ULTIMATE.start_main_~string_B~5_val_0_in_2 v_ULTIMATE.start_main_~string_B~5_val_0_out_1) (= (+ v_ULTIMATE.start_main_~i~5_13 1) v_ULTIMATE.start_main_~i~5_12) (or (not (= v_ULTIMATE.start_main_~i~5_13 v_ULTIMATE.start_main_~string_B~5_idx_0_term_4)) (= v_ULTIMATE.start_main_~string_B~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet3_3|)) (<= |v_ULTIMATE.start_main_#t~nondet3_3| 127) (< v_ULTIMATE.start_main_~i~5_13 5) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3_3| 128)) (or (not v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~i~5_13 v_ULTIMATE.start_main_~string_B~5_idx_0_term_4)) v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1) InVars {ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_13, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_out_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_12, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~string_B~5_val_0, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:04,988 INFO L635 onniauxMapEliminator]: L87 [2019-05-15 10:56:05,031 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:05 BasicIcfg [2019-05-15 10:56:05,031 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:05,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:05,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:05,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:05,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:04" (1/3) ... [2019-05-15 10:56:05,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1fa667 and model type string.i_3.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,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:04" (2/3) ... [2019-05-15 10:56:05,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1fa667 and model type string.i_3.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,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:05" (3/3) ... [2019-05-15 10:56:05,042 INFO L109 eAbstractionObserver]: Analyzing ICFG string.i_3.bplME [2019-05-15 10:56:05,053 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:05,061 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:56:05,077 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:56:05,101 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:05,102 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:05,102 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:05,103 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:05,103 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:05,103 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:05,103 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:05,103 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:05,104 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-05-15 10:56:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:56:05,132 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:05,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:56:05,135 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:05,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1540260, now seen corresponding path program 1 times [2019-05-15 10:56:05,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:05,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-15 10:56:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:05,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:05,367 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} [20] ULTIMATE.startENTRY-->L52: Formula: (and (= v_ULTIMATE.start_main_~i~5_1 0) (= v_ULTIMATE.start_main_~found~5_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~nc_A~5=v_ULTIMATE.start_main_~nc_A~5_1, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_~found~5=v_ULTIMATE.start_main_~found~5_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_#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_~nc_B~5=v_ULTIMATE.start_main_~nc_B~5_1, ULTIMATE.start_main_~string_A~5=v_ULTIMATE.start_main_~string_A~5_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~string_B~5=v_ULTIMATE.start_main_~string_B~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~nc_A~5, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~found~5, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~nc_B~5, ULTIMATE.start_main_~string_A~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~string_B~5, ULTIMATE.start_main_~j~5] {14#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-05-15 10:56:05,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {14#(<= ULTIMATE.start_main_~i~5 0)} [21] L52-->L87: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_1 4))) (and (or .cse0 (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) (or (= v_v_ULTIMATE.start_main_~string_A~5_4_aux_1 v_ULTIMATE.start_main_~string_A~5_val_0_in_1) (not .cse0)) (= v_v_ULTIMATE.start_main_~string_A~5_4_aux_1 0) (= v_ULTIMATE.start_main_~i~5_6 0) (not (< v_ULTIMATE.start_main_~i~5_7 5)) v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_1, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7} OutVars{ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_1, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} AuxVars[v_v_ULTIMATE.start_main_~string_A~5_4_aux_1] AssignedVars[ULTIMATE.start_main_~i~5] {10#false} is VALID [2019-05-15 10:56:05,378 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} [23] L87-->L78: Formula: (let ((.cse16 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_A~5_4)) (.cse14 (= 4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3)) (.cse15 (= v_ULTIMATE.start_main_~nc_B~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3))) (and (let ((.cse0 (= v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~j~5_4)) (.cse1 (or (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_B~5_4) (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) .cse16 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 4))) (.cse2 (not (< v_ULTIMATE.start_main_~i~5_11 5))) (.cse3 (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1)) (.cse4 (= 0 v_v_ULTIMATE.start_main_~string_B~5_4_aux_2)) (.cse5 (= v_ULTIMATE.start_main_~j~5_4 0)) (.cse6 (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (or (= 0 v_ULTIMATE.start_main_~found~5_4) (= 1 v_ULTIMATE.start_main_~found~5_4)) 1 0))) (.cse7 (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|)) (.cse8 (= 0 v_v_ULTIMATE.start_main_~string_B~5_4_aux_1)) (.cse9 (= v_ULTIMATE.start_main_~nc_A~5_4 0)) (.cse10 (= v_ULTIMATE.start_main_~nc_B~5_4 0)) (.cse11 (or (not v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3) .cse14 .cse15)) (.cse12 (= 0 v_v_ULTIMATE.start_main_~string_A~5_7_aux_1)) (.cse13 (<= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~nc_B~5_4))) (or (and .cse0 .cse1 .cse2 .cse3 (not (< v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~nc_A~5_4)) .cse4 .cse5 .cse6 v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1 .cse7 .cse8 .cse9 (not (< v_ULTIMATE.start_main_~j~5_4 v_ULTIMATE.start_main_~nc_B~5_4)) .cse10 .cse11 .cse12 .cse13 v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1))) (or (= v_ULTIMATE.start_main_~string_A~5_val_0_in_3 v_v_ULTIMATE.start_main_~string_A~5_7_aux_1) (not .cse16)) (or (not .cse14) (= v_ULTIMATE.start_main_~string_B~5_val_0_in_1 v_v_ULTIMATE.start_main_~string_B~5_4_aux_2)) (or (= v_ULTIMATE.start_main_~string_B~5_val_0_in_1 v_v_ULTIMATE.start_main_~string_B~5_4_aux_1) (not .cse15)))) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_3, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_11, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start_main_~nc_A~5=v_ULTIMATE.start_main_~nc_A~5_4, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_3, ULTIMATE.start_main_~found~5=v_ULTIMATE.start_main_~found~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1, ULTIMATE.start_main_~nc_B~5=v_ULTIMATE.start_main_~nc_B~5_4, ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_3, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_1} AuxVars[v_v_ULTIMATE.start_main_~string_B~5_4_aux_1, v_v_ULTIMATE.start_main_~string_B~5_4_aux_2, v_v_ULTIMATE.start_main_~string_A~5_7_aux_1] AssignedVars[ULTIMATE.start_main_~nc_B~5, ULTIMATE.start_main_~nc_A~5, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_~found~5, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~i~5] {10#false} is VALID [2019-05-15 10:56:05,380 INFO L273 TraceCheckUtils]: 3: Hoare triple {10#false} [25] L78-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10#false} is VALID [2019-05-15 10:56:05,382 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:05,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:05,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:56:05,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-15 10:56:05,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:05,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:05,437 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:05,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:05,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:05,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:05,447 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-05-15 10:56:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:05,633 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-05-15 10:56:05,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:05,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-15 10:56:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-05-15 10:56:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-05-15 10:56:05,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-05-15 10:56:05,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:05,711 INFO L225 Difference]: With dead ends: 7 [2019-05-15 10:56:05,714 INFO L226 Difference]: Without dead ends: 7 [2019-05-15 10:56:05,716 INFO L628 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 [2019-05-15 10:56:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-05-15 10:56:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-05-15 10:56:05,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:05,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:05,741 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:05,741 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:05,743 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-05-15 10:56:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-05-15 10:56:05,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:05,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:05,744 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:05,744 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:05,746 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-05-15 10:56:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-05-15 10:56:05,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:05,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:05,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:05,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:56:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-05-15 10:56:05,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-05-15 10:56:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:05,751 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-05-15 10:56:05,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-05-15 10:56:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-05-15 10:56:05,752 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:05,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-05-15 10:56:05,752 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1481053576, now seen corresponding path program 1 times [2019-05-15 10:56:05,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:05,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:56:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:05,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:06,076 INFO L273 TraceCheckUtils]: 0: Hoare triple {51#true} [20] ULTIMATE.startENTRY-->L52: Formula: (and (= v_ULTIMATE.start_main_~i~5_1 0) (= v_ULTIMATE.start_main_~found~5_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~nc_A~5=v_ULTIMATE.start_main_~nc_A~5_1, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_~found~5=v_ULTIMATE.start_main_~found~5_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_#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_~nc_B~5=v_ULTIMATE.start_main_~nc_B~5_1, ULTIMATE.start_main_~string_A~5=v_ULTIMATE.start_main_~string_A~5_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~string_B~5=v_ULTIMATE.start_main_~string_B~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~nc_A~5, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~found~5, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~nc_B~5, ULTIMATE.start_main_~string_A~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~string_B~5, ULTIMATE.start_main_~j~5] {56#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-05-15 10:56:06,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(<= ULTIMATE.start_main_~i~5 0)} [22] L52-->L52: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_2 v_ULTIMATE.start_main_~i~5_9))) (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)) (or (not .cse0) (= v_ULTIMATE.start_main_~string_A~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet1_3|)) (< v_ULTIMATE.start_main_~i~5_9 5) (or .cse0 (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) (= v_ULTIMATE.start_main_~string_A~5_val_0_out_1 v_ULTIMATE.start_main_~string_A~5_val_0_in_2) (<= |v_ULTIMATE.start_main_#t~nondet1_3| 127) v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_2, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_9} OutVars{ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_2, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_out_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~string_A~5_val_0, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~5] {60#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-05-15 10:56:06,099 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#(<= ULTIMATE.start_main_~i~5 1)} [21] L52-->L87: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_1 4))) (and (or .cse0 (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) (or (= v_v_ULTIMATE.start_main_~string_A~5_4_aux_1 v_ULTIMATE.start_main_~string_A~5_val_0_in_1) (not .cse0)) (= v_v_ULTIMATE.start_main_~string_A~5_4_aux_1 0) (= v_ULTIMATE.start_main_~i~5_6 0) (not (< v_ULTIMATE.start_main_~i~5_7 5)) v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_1, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7} OutVars{ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_1, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} AuxVars[v_v_ULTIMATE.start_main_~string_A~5_4_aux_1] AssignedVars[ULTIMATE.start_main_~i~5] {52#false} is VALID [2019-05-15 10:56:06,099 INFO L273 TraceCheckUtils]: 3: Hoare triple {52#false} [24] L87-->L87: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~i~5_13 v_ULTIMATE.start_main_~string_B~5_idx_0_term_4))) (and (= v_ULTIMATE.start_main_~string_B~5_val_0_in_2 v_ULTIMATE.start_main_~string_B~5_val_0_out_1) (= (+ v_ULTIMATE.start_main_~i~5_13 1) v_ULTIMATE.start_main_~i~5_12) (or (not .cse0) (= v_ULTIMATE.start_main_~string_B~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet3_3|)) (<= |v_ULTIMATE.start_main_#t~nondet3_3| 127) (< v_ULTIMATE.start_main_~i~5_13 5) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3_3| 128)) (or (not v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1) .cse0) v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_13, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_out_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_12, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~string_B~5_val_0, ULTIMATE.start_main_~i~5] {52#false} is VALID [2019-05-15 10:56:06,100 INFO L273 TraceCheckUtils]: 4: Hoare triple {52#false} [23] L87-->L78: Formula: (let ((.cse16 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_A~5_4)) (.cse14 (= 4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3)) (.cse15 (= v_ULTIMATE.start_main_~nc_B~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3))) (and (let ((.cse0 (= v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~j~5_4)) (.cse1 (or (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_B~5_4) (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) .cse16 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 4))) (.cse2 (not (< v_ULTIMATE.start_main_~i~5_11 5))) (.cse3 (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1)) (.cse4 (= 0 v_v_ULTIMATE.start_main_~string_B~5_4_aux_2)) (.cse5 (= v_ULTIMATE.start_main_~j~5_4 0)) (.cse6 (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (or (= 0 v_ULTIMATE.start_main_~found~5_4) (= 1 v_ULTIMATE.start_main_~found~5_4)) 1 0))) (.cse7 (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|)) (.cse8 (= 0 v_v_ULTIMATE.start_main_~string_B~5_4_aux_1)) (.cse9 (= v_ULTIMATE.start_main_~nc_A~5_4 0)) (.cse10 (= v_ULTIMATE.start_main_~nc_B~5_4 0)) (.cse11 (or (not v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3) .cse14 .cse15)) (.cse12 (= 0 v_v_ULTIMATE.start_main_~string_A~5_7_aux_1)) (.cse13 (<= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~nc_B~5_4))) (or (and .cse0 .cse1 .cse2 .cse3 (not (< v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~nc_A~5_4)) .cse4 .cse5 .cse6 v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1 .cse7 .cse8 .cse9 (not (< v_ULTIMATE.start_main_~j~5_4 v_ULTIMATE.start_main_~nc_B~5_4)) .cse10 .cse11 .cse12 .cse13 v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1))) (or (= v_ULTIMATE.start_main_~string_A~5_val_0_in_3 v_v_ULTIMATE.start_main_~string_A~5_7_aux_1) (not .cse16)) (or (not .cse14) (= v_ULTIMATE.start_main_~string_B~5_val_0_in_1 v_v_ULTIMATE.start_main_~string_B~5_4_aux_2)) (or (= v_ULTIMATE.start_main_~string_B~5_val_0_in_1 v_v_ULTIMATE.start_main_~string_B~5_4_aux_1) (not .cse15)))) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_3, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_11, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start_main_~nc_A~5=v_ULTIMATE.start_main_~nc_A~5_4, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_3, ULTIMATE.start_main_~found~5=v_ULTIMATE.start_main_~found~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1, ULTIMATE.start_main_~nc_B~5=v_ULTIMATE.start_main_~nc_B~5_4, ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_3, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_1} AuxVars[v_v_ULTIMATE.start_main_~string_B~5_4_aux_1, v_v_ULTIMATE.start_main_~string_B~5_4_aux_2, v_v_ULTIMATE.start_main_~string_A~5_7_aux_1] AssignedVars[ULTIMATE.start_main_~nc_B~5, ULTIMATE.start_main_~nc_A~5, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_~found~5, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~i~5] {52#false} is VALID [2019-05-15 10:56:06,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {52#false} [25] L78-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#false} is VALID [2019-05-15 10:56:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-05-15 10:56:06,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:56:06,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-15 10:56:06,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-05-15 10:56:06,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:06,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:56:06,165 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,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:56:06,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:56:06,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:06,167 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-05-15 10:56:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,390 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-05-15 10:56:06,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:56:06,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-05-15 10:56:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-05-15 10:56:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-05-15 10:56:06,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 12 transitions. [2019-05-15 10:56:06,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,484 INFO L225 Difference]: With dead ends: 9 [2019-05-15 10:56:06,484 INFO L226 Difference]: Without dead ends: 9 [2019-05-15 10:56:06,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-05-15 10:56:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-05-15 10:56:06,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:06,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-05-15 10:56:06,490 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-05-15 10:56:06,491 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-05-15 10:56:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,492 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-05-15 10:56:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-05-15 10:56:06,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,493 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-05-15 10:56:06,493 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-05-15 10:56:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,495 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-05-15 10:56:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-05-15 10:56:06,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:06,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:56:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-05-15 10:56:06,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-05-15 10:56:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:06,500 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-05-15 10:56:06,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:56:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-05-15 10:56:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-05-15 10:56:06,501 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:06,501 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-05-15 10:56:06,502 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:06,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:06,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1684199716, now seen corresponding path program 2 times [2019-05-15 10:56:06,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:56:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:06,729 INFO L273 TraceCheckUtils]: 0: Hoare triple {108#true} [20] ULTIMATE.startENTRY-->L52: Formula: (and (= v_ULTIMATE.start_main_~i~5_1 0) (= v_ULTIMATE.start_main_~found~5_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~nc_A~5=v_ULTIMATE.start_main_~nc_A~5_1, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_~found~5=v_ULTIMATE.start_main_~found~5_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_#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_~nc_B~5=v_ULTIMATE.start_main_~nc_B~5_1, ULTIMATE.start_main_~string_A~5=v_ULTIMATE.start_main_~string_A~5_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~string_B~5=v_ULTIMATE.start_main_~string_B~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~nc_A~5, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~found~5, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~nc_B~5, ULTIMATE.start_main_~string_A~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~string_B~5, ULTIMATE.start_main_~j~5] {113#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-05-15 10:56:06,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {113#(<= ULTIMATE.start_main_~i~5 0)} [22] L52-->L52: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_2 v_ULTIMATE.start_main_~i~5_9))) (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)) (or (not .cse0) (= v_ULTIMATE.start_main_~string_A~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet1_3|)) (< v_ULTIMATE.start_main_~i~5_9 5) (or .cse0 (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) (= v_ULTIMATE.start_main_~string_A~5_val_0_out_1 v_ULTIMATE.start_main_~string_A~5_val_0_in_2) (<= |v_ULTIMATE.start_main_#t~nondet1_3| 127) v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_2, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_9} OutVars{ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_2, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_out_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~string_A~5_val_0, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~5] {117#(and (<= ULTIMATE.start_main_~string_A~5_idx_0 0) ULTIMATE.start_main_~string_A~5_idx_0_bool)} is VALID [2019-05-15 10:56:06,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {117#(and (<= ULTIMATE.start_main_~string_A~5_idx_0 0) ULTIMATE.start_main_~string_A~5_idx_0_bool)} [22] L52-->L52: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_2 v_ULTIMATE.start_main_~i~5_9))) (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)) (or (not .cse0) (= v_ULTIMATE.start_main_~string_A~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet1_3|)) (< v_ULTIMATE.start_main_~i~5_9 5) (or .cse0 (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) (= v_ULTIMATE.start_main_~string_A~5_val_0_out_1 v_ULTIMATE.start_main_~string_A~5_val_0_in_2) (<= |v_ULTIMATE.start_main_#t~nondet1_3| 127) v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_2, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_9} OutVars{ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_2, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_out_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~string_A~5_val_0, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~5] {117#(and (<= ULTIMATE.start_main_~string_A~5_idx_0 0) ULTIMATE.start_main_~string_A~5_idx_0_bool)} is VALID [2019-05-15 10:56:06,762 INFO L273 TraceCheckUtils]: 3: Hoare triple {117#(and (<= ULTIMATE.start_main_~string_A~5_idx_0 0) ULTIMATE.start_main_~string_A~5_idx_0_bool)} [21] L52-->L87: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_1 4))) (and (or .cse0 (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) (or (= v_v_ULTIMATE.start_main_~string_A~5_4_aux_1 v_ULTIMATE.start_main_~string_A~5_val_0_in_1) (not .cse0)) (= v_v_ULTIMATE.start_main_~string_A~5_4_aux_1 0) (= v_ULTIMATE.start_main_~i~5_6 0) (not (< v_ULTIMATE.start_main_~i~5_7 5)) v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_1, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7} OutVars{ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_1, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} AuxVars[v_v_ULTIMATE.start_main_~string_A~5_4_aux_1] AssignedVars[ULTIMATE.start_main_~i~5] {109#false} is VALID [2019-05-15 10:56:06,763 INFO L273 TraceCheckUtils]: 4: Hoare triple {109#false} [24] L87-->L87: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~i~5_13 v_ULTIMATE.start_main_~string_B~5_idx_0_term_4))) (and (= v_ULTIMATE.start_main_~string_B~5_val_0_in_2 v_ULTIMATE.start_main_~string_B~5_val_0_out_1) (= (+ v_ULTIMATE.start_main_~i~5_13 1) v_ULTIMATE.start_main_~i~5_12) (or (not .cse0) (= v_ULTIMATE.start_main_~string_B~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet3_3|)) (<= |v_ULTIMATE.start_main_#t~nondet3_3| 127) (< v_ULTIMATE.start_main_~i~5_13 5) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3_3| 128)) (or (not v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1) .cse0) v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_13, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_out_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_12, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~string_B~5_val_0, ULTIMATE.start_main_~i~5] {109#false} is VALID [2019-05-15 10:56:06,763 INFO L273 TraceCheckUtils]: 5: Hoare triple {109#false} [24] L87-->L87: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~i~5_13 v_ULTIMATE.start_main_~string_B~5_idx_0_term_4))) (and (= v_ULTIMATE.start_main_~string_B~5_val_0_in_2 v_ULTIMATE.start_main_~string_B~5_val_0_out_1) (= (+ v_ULTIMATE.start_main_~i~5_13 1) v_ULTIMATE.start_main_~i~5_12) (or (not .cse0) (= v_ULTIMATE.start_main_~string_B~5_val_0_in_2 |v_ULTIMATE.start_main_#t~nondet3_3|)) (<= |v_ULTIMATE.start_main_#t~nondet3_3| 127) (< v_ULTIMATE.start_main_~i~5_13 5) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3_3| 128)) (or (not v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1) .cse0) v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_2, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_13, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_4, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_out_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_12, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~string_B~5_val_0, ULTIMATE.start_main_~i~5] {109#false} is VALID [2019-05-15 10:56:06,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {109#false} [23] L87-->L78: Formula: (let ((.cse16 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_A~5_4)) (.cse14 (= 4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3)) (.cse15 (= v_ULTIMATE.start_main_~nc_B~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3))) (and (let ((.cse0 (= v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~j~5_4)) (.cse1 (or (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 v_ULTIMATE.start_main_~nc_B~5_4) (not v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) .cse16 (= v_ULTIMATE.start_main_~string_A~5_idx_0_term_3 4))) (.cse2 (not (< v_ULTIMATE.start_main_~i~5_11 5))) (.cse3 (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1)) (.cse4 (= 0 v_v_ULTIMATE.start_main_~string_B~5_4_aux_2)) (.cse5 (= v_ULTIMATE.start_main_~j~5_4 0)) (.cse6 (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (or (= 0 v_ULTIMATE.start_main_~found~5_4) (= 1 v_ULTIMATE.start_main_~found~5_4)) 1 0))) (.cse7 (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|)) (.cse8 (= 0 v_v_ULTIMATE.start_main_~string_B~5_4_aux_1)) (.cse9 (= v_ULTIMATE.start_main_~nc_A~5_4 0)) (.cse10 (= v_ULTIMATE.start_main_~nc_B~5_4 0)) (.cse11 (or (not v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~string_B~5_idx_0_term_3) .cse14 .cse15)) (.cse12 (= 0 v_v_ULTIMATE.start_main_~string_A~5_7_aux_1)) (.cse13 (<= v_ULTIMATE.start_main_~nc_A~5_4 v_ULTIMATE.start_main_~nc_B~5_4))) (or (and .cse0 .cse1 .cse2 .cse3 (not (< v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~nc_A~5_4)) .cse4 .cse5 .cse6 v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1 .cse7 .cse8 .cse9 (not (< v_ULTIMATE.start_main_~j~5_4 v_ULTIMATE.start_main_~nc_B~5_4)) .cse10 .cse11 .cse12 .cse13 v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1))) (or (= v_ULTIMATE.start_main_~string_A~5_val_0_in_3 v_v_ULTIMATE.start_main_~string_A~5_7_aux_1) (not .cse16)) (or (not .cse14) (= v_ULTIMATE.start_main_~string_B~5_val_0_in_1 v_v_ULTIMATE.start_main_~string_B~5_4_aux_2)) (or (= v_ULTIMATE.start_main_~string_B~5_val_0_in_1 v_v_ULTIMATE.start_main_~string_B~5_4_aux_1) (not .cse15)))) InVars {ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_3, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_11, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start_main_~nc_A~5=v_ULTIMATE.start_main_~nc_A~5_4, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~string_B~5_idx_0=v_ULTIMATE.start_main_~string_B~5_idx_0_term_3, ULTIMATE.start_main_~found~5=v_ULTIMATE.start_main_~found~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10, ULTIMATE.start_main_~string_B~5_idx_0_bool=v_ULTIMATE.start_main_~string_B~5_idx_0_term_assigned_1, ULTIMATE.start_main_~nc_B~5=v_ULTIMATE.start_main_~nc_B~5_4, ULTIMATE.start_main_~string_A~5_idx_0=v_ULTIMATE.start_main_~string_A~5_idx_0_term_3, ULTIMATE.start_main_~string_A~5_idx_0_bool=v_ULTIMATE.start_main_~string_A~5_idx_0_term_assigned_1, ULTIMATE.start_main_~string_A~5_val_0=v_ULTIMATE.start_main_~string_A~5_val_0_in_3, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_4, ULTIMATE.start_main_~string_B~5_val_0=v_ULTIMATE.start_main_~string_B~5_val_0_in_1} AuxVars[v_v_ULTIMATE.start_main_~string_B~5_4_aux_1, v_v_ULTIMATE.start_main_~string_B~5_4_aux_2, v_v_ULTIMATE.start_main_~string_A~5_7_aux_1] AssignedVars[ULTIMATE.start_main_~nc_B~5, ULTIMATE.start_main_~nc_A~5, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_~found~5, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~i~5] {109#false} is VALID [2019-05-15 10:56:06,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {109#false} [25] L78-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#false} is VALID [2019-05-15 10:56:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-05-15 10:56:06,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:56:06,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-15 10:56:06,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-05-15 10:56:06,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:06,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:56:06,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:56:06,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:56:06,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:06,793 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-05-15 10:56:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,821 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-05-15 10:56:06,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:56:06,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-05-15 10:56:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-15 10:56:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-15 10:56:06,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4 transitions. [2019-05-15 10:56:06,848 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:06,848 INFO L225 Difference]: With dead ends: 4 [2019-05-15 10:56:06,848 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:56:06,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:56:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:56:06,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:06,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:06,849 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:06,850 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,850 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:06,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,850 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:06,851 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,851 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:06,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:06,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:56:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:56:06,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-05-15 10:56:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:06,852 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:56:06,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:56:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:06,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,855 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:06,857 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:06 BasicIcfg [2019-05-15 10:56:06,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:06,858 INFO L168 Benchmark]: Toolchain (without parser) took 2584.77 ms. Allocated memory was 140.5 MB in the beginning and 176.7 MB in the end (delta: 36.2 MB). Free memory was 109.9 MB in the beginning and 103.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 42.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:06,860 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:06,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.81 ms. Allocated memory is still 140.5 MB. Free memory was 109.9 MB in the beginning and 108.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:06,861 INFO L168 Benchmark]: Boogie Preprocessor took 27.21 ms. Allocated memory is still 140.5 MB. Free memory was 108.1 MB in the beginning and 107.2 MB in the end (delta: 910.2 kB). Peak memory consumption was 910.2 kB. Max. memory is 7.1 GB. [2019-05-15 10:56:06,862 INFO L168 Benchmark]: RCFGBuilder took 509.32 ms. Allocated memory is still 140.5 MB. Free memory was 106.8 MB in the beginning and 93.9 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:06,863 INFO L168 Benchmark]: IcfgTransformer took 171.33 ms. Allocated memory is still 140.5 MB. Free memory was 93.9 MB in the beginning and 88.3 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:06,864 INFO L168 Benchmark]: TraceAbstraction took 1823.92 ms. Allocated memory was 140.5 MB in the beginning and 176.7 MB in the end (delta: 36.2 MB). Free memory was 88.3 MB in the beginning and 103.9 MB in the end (delta: -15.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:06,869 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.22 ms. Allocated memory is still 140.5 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.81 ms. Allocated memory is still 140.5 MB. Free memory was 109.9 MB in the beginning and 108.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.21 ms. Allocated memory is still 140.5 MB. Free memory was 108.1 MB in the beginning and 107.2 MB in the end (delta: 910.2 kB). Peak memory consumption was 910.2 kB. Max. memory is 7.1 GB. * RCFGBuilder took 509.32 ms. Allocated memory is still 140.5 MB. Free memory was 106.8 MB in the beginning and 93.9 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * IcfgTransformer took 171.33 ms. Allocated memory is still 140.5 MB. Free memory was 93.9 MB in the beginning and 88.3 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1823.92 ms. Allocated memory was 140.5 MB in the beginning and 176.7 MB in the end (delta: 36.2 MB). Free memory was 88.3 MB in the beginning and 103.9 MB in the end (delta: -15.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 89]: 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, 6 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5 SDtfs, 2 SDslu, 5 SDs, 0 SdLazy, 18 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=2, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 179 SizeOfPredicates, 2 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 5/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...