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/insertion_sort.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-48de6b2 [2019-04-26 16:09:53,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-26 16:09:53,689 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-26 16:09:53,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-26 16:09:53,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-26 16:09:53,709 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-26 16:09:53,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-26 16:09:53,713 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-26 16:09:53,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-26 16:09:53,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-26 16:09:53,721 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-26 16:09:53,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-26 16:09:53,727 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-26 16:09:53,731 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-26 16:09:53,733 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-26 16:09:53,733 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-26 16:09:53,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-26 16:09:53,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-26 16:09:53,745 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-26 16:09:53,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-26 16:09:53,748 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-26 16:09:53,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-26 16:09:53,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-26 16:09:53,755 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-26 16:09:53,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-26 16:09:53,758 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-26 16:09:53,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-26 16:09:53,759 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-26 16:09:53,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-26 16:09:53,762 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-26 16:09:53,763 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-26 16:09:53,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-26 16:09:53,766 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-26 16:09:53,766 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-26 16:09:53,767 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-26 16:09:53,767 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-26 16:09:53,767 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-26 16:09:53,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-26 16:09:53,770 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-04-26 16:09:53,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-26 16:09:53,833 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-26 16:09:53,836 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-26 16:09:53,838 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-04-26 16:09:53,838 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-04-26 16:09:53,839 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl [2019-04-26 16:09:53,840 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl' [2019-04-26 16:09:53,876 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-26 16:09:53,878 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-26 16:09:53,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-04-26 16:09:53,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-04-26 16:09:53,879 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-04-26 16:09:53,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-04-26 16:09:53,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-26 16:09:53,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-26 16:09:53,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-26 16:09:53,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/1) ... [2019-04-26 16:09:53,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-26 16:09:53,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-26 16:09:53,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-26 16:09:53,941 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-26 16:09:53,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (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-04-26 16:09:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-04-26 16:09:54,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-04-26 16:09:54,368 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-04-26 16:09:54,369 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-04-26 16:09:54,370 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:54 BoogieIcfgContainer [2019-04-26 16:09:54,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-26 16:09:54,371 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-04-26 16:09:54,371 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-04-26 16:09:54,372 INFO L276 PluginConnector]: IcfgTransformer initialized [2019-04-26 16:09:54,374 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:54" (1/1) ... [2019-04-26 16:09:54,417 INFO L359 onniauxMapEliminator]: L53 [2019-04-26 16:09:54,418 INFO L360 onniauxMapEliminator]: In Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= (select v_ULTIMATE.start_main_~v~5_4 (+ v_ULTIMATE.start_main_~k~5_4 (- 1))) (select v_ULTIMATE.start_main_~v~5_4 v_ULTIMATE.start_main_~k~5_4)) 1 0)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (< (mod v_ULTIMATE.start_main_~k~5_4 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_4 4294967296)) (not (< (mod v_ULTIMATE.start_main_~j~5_5 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_4 4294967296))) (= v_ULTIMATE.start_main_~k~5_4 1)) InVars {ULTIMATE.start_main_~v~5=v_ULTIMATE.start_main_~v~5_4, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} OutVars{ULTIMATE.start_main_~v~5=v_ULTIMATE.start_main_~v~5_4, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~k~5] [2019-04-26 16:09:54,418 INFO L361 onniauxMapEliminator]: Out Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or (= v_ULTIMATE.start_main_~v~5_val_0_in_1 v_v_ULTIMATE.start_main_~v~5_4_aux_2) (not (= v_ULTIMATE.start_main_~v~5_idx_0_term_1 (+ v_ULTIMATE.start_main_~k~5_4 (- 1))))) (or (= v_ULTIMATE.start_main_~v~5_val_0_in_1 v_v_ULTIMATE.start_main_~v~5_4_aux_1) (not (= v_ULTIMATE.start_main_~v~5_idx_0_term_1 v_ULTIMATE.start_main_~k~5_4))) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (< (mod v_ULTIMATE.start_main_~k~5_4 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_4 4294967296)) (not (< (mod v_ULTIMATE.start_main_~j~5_5 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_4 4294967296))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= v_v_ULTIMATE.start_main_~v~5_4_aux_2 v_v_ULTIMATE.start_main_~v~5_4_aux_1) 1 0)) (= v_ULTIMATE.start_main_~k~5_4 1) (or (= v_ULTIMATE.start_main_~v~5_idx_0_term_1 (+ v_ULTIMATE.start_main_~k~5_4 (- 1))) (= v_ULTIMATE.start_main_~v~5_idx_0_term_1 v_ULTIMATE.start_main_~k~5_4))) InVars {ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start_main_~v~5_val_0=v_ULTIMATE.start_main_~v~5_val_0_in_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} OutVars{ULTIMATE.start_main_~v~5_val_0=v_ULTIMATE.start_main_~v~5_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~v~5_idx_0=v_ULTIMATE.start_main_~v~5_idx_0_term_1, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} AuxVars[v_v_ULTIMATE.start_main_~v~5_4_aux_2, v_v_ULTIMATE.start_main_~v~5_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_~v~5_idx_0, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~k~5] [2019-04-26 16:09:54,418 INFO L362 onniauxMapEliminator]: L42 [2019-04-26 16:09:54,443 INFO L359 onniauxMapEliminator]: L53 [2019-04-26 16:09:54,443 INFO L360 onniauxMapEliminator]: In Formula: (and (or (not (<= 0 v_ULTIMATE.start_main_~i~5_4)) (not (< v_ULTIMATE.start_main_~key~5_4 (select v_ULTIMATE.start_main_~v~5_6 v_ULTIMATE.start_main_~i~5_4)))) (= v_ULTIMATE.start_main_~v~5_5 (store v_ULTIMATE.start_main_~v~5_6 (+ v_ULTIMATE.start_main_~i~5_4 1) v_ULTIMATE.start_main_~key~5_4)) (= (+ v_ULTIMATE.start_main_~j~5_7 1) v_ULTIMATE.start_main_~j~5_6) (= v_ULTIMATE.start_main_~i~5_4 (+ v_ULTIMATE.start_main_~j~5_7 (- 1))) (< (mod v_ULTIMATE.start_main_~j~5_7 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_5 4294967296)) (= v_ULTIMATE.start_main_~key~5_4 (select v_ULTIMATE.start_main_~v~5_6 v_ULTIMATE.start_main_~j~5_7))) InVars {ULTIMATE.start_main_~v~5=v_ULTIMATE.start_main_~v~5_6, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_5, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_7} OutVars{ULTIMATE.start_main_~v~5=v_ULTIMATE.start_main_~v~5_5, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_5, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_6, ULTIMATE.start_main_~key~5=v_ULTIMATE.start_main_~key~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~v~5, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~key~5, ULTIMATE.start_main_~i~5] [2019-04-26 16:09:54,444 INFO L361 onniauxMapEliminator]: Out Formula: (and (or (not (= v_ULTIMATE.start_main_~v~5_idx_0_term_2 v_ULTIMATE.start_main_~j~5_7)) (= v_v_ULTIMATE.start_main_~v~5_6_aux_1 v_ULTIMATE.start_main_~v~5_val_0_in_2)) (= v_v_ULTIMATE.start_main_~v~5_6_aux_1 v_ULTIMATE.start_main_~key~5_4) (= (+ v_ULTIMATE.start_main_~j~5_7 1) v_ULTIMATE.start_main_~j~5_6) (or (not (= v_ULTIMATE.start_main_~v~5_idx_0_term_2 (+ v_ULTIMATE.start_main_~i~5_4 1))) (= v_ULTIMATE.start_main_~key~5_4 v_ULTIMATE.start_main_~v~5_val_0_in_2)) (or (= v_ULTIMATE.start_main_~v~5_idx_0_term_2 v_ULTIMATE.start_main_~j~5_7) (= v_ULTIMATE.start_main_~v~5_idx_0_term_2 v_ULTIMATE.start_main_~i~5_4) (= v_ULTIMATE.start_main_~v~5_idx_0_term_2 (+ v_ULTIMATE.start_main_~i~5_4 1)) (= v_ULTIMATE.start_main_~v~5_idx_0_term_2 v_ULTIMATE.start_main_~v~5_idx_0_term_1)) (= v_ULTIMATE.start_main_~i~5_4 (+ v_ULTIMATE.start_main_~j~5_7 (- 1))) (or (not (<= 0 v_ULTIMATE.start_main_~i~5_4)) (not (< v_ULTIMATE.start_main_~key~5_4 v_v_ULTIMATE.start_main_~v~5_6_aux_2))) (< (mod v_ULTIMATE.start_main_~j~5_7 4294967296) (mod v_ULTIMATE.start_main_~SIZE~5_5 4294967296)) (or (= v_v_ULTIMATE.start_main_~v~5_6_aux_2 v_ULTIMATE.start_main_~v~5_val_0_in_2) (not (= v_ULTIMATE.start_main_~v~5_idx_0_term_2 v_ULTIMATE.start_main_~i~5_4)))) InVars {ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_5, ULTIMATE.start_main_~v~5_val_0=v_ULTIMATE.start_main_~v~5_val_0_in_2, ULTIMATE.start_main_~v~5_idx_0=v_ULTIMATE.start_main_~v~5_idx_0_term_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_7} OutVars{ULTIMATE.start_main_~v~5_val_0=v_ULTIMATE.start_main_~v~5_val_0_out_1, ULTIMATE.start_main_~v~5_idx_0=v_ULTIMATE.start_main_~v~5_idx_0_term_2, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_5, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_6, ULTIMATE.start_main_~key~5=v_ULTIMATE.start_main_~key~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_4} AuxVars[v_v_ULTIMATE.start_main_~v~5_6_aux_1, v_v_ULTIMATE.start_main_~v~5_6_aux_2] AssignedVars[ULTIMATE.start_main_~v~5_val_0, ULTIMATE.start_main_~v~5_idx_0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~key~5, ULTIMATE.start_main_~i~5] [2019-04-26 16:09:54,444 INFO L362 onniauxMapEliminator]: L53 [2019-04-26 16:09:54,457 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 26.04 04:09:54 BasicIcfg [2019-04-26 16:09:54,457 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-04-26 16:09:54,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-26 16:09:54,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-26 16:09:54,462 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-26 16:09:54,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:09:53" (1/3) ... [2019-04-26 16:09:54,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8bdf9f and model type insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.04 04:09:54, skipping insertion in model container [2019-04-26 16:09:54,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:54" (2/3) ... [2019-04-26 16:09:54,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8bdf9f and model type insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.04 04:09:54, skipping insertion in model container [2019-04-26 16:09:54,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 26.04 04:09:54" (3/3) ... [2019-04-26 16:09:54,467 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort.i_3.bplME [2019-04-26 16:09:54,476 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-26 16:09:54,485 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-04-26 16:09:54,505 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-26 16:09:54,544 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-04-26 16:09:54,545 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-26 16:09:54,545 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-26 16:09:54,545 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-26 16:09:54,546 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-26 16:09:54,546 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-26 16:09:54,546 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-26 16:09:54,546 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-26 16:09:54,547 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-04-26 16:09:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-04-26 16:09:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-26 16:09:54,572 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:09:54,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-26 16:09:54,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:09:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:09:54,582 INFO L82 PathProgramCache]: Analyzing trace with hash 42734, now seen corresponding path program 1 times [2019-04-26 16:09:54,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:09:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:54,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-04-26 16:09:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:09:54,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-26 16:09:54,855 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} [13] ULTIMATE.startENTRY-->L53: Formula: (and (= v_ULTIMATE.start_main_~SIZE~5_1 |v_ULTIMATE.start_main_#t~nondet0_3|) (= v_ULTIMATE.start_main_~j~5_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~v~5=v_ULTIMATE.start_main_~v~5_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_1, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1, ULTIMATE.start_main_~key~5=v_ULTIMATE.start_main_~key~5_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_3|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~v~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~SIZE~5, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~k~5, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~key~5, ULTIMATE.start_main_~i~5] {13#(= ULTIMATE.start_main_~j~5 1)} is VALID [2019-04-26 16:09:54,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(= ULTIMATE.start_main_~j~5 1)} [14] L53-->L42: Formula: (let ((.cse2 (mod v_ULTIMATE.start_main_~SIZE~5_4 4294967296)) (.cse0 (= v_ULTIMATE.start_main_~v~5_idx_0_term_1 (+ v_ULTIMATE.start_main_~k~5_4 (- 1)))) (.cse1 (= v_ULTIMATE.start_main_~v~5_idx_0_term_1 v_ULTIMATE.start_main_~k~5_4))) (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or (= v_ULTIMATE.start_main_~v~5_val_0_in_1 v_v_ULTIMATE.start_main_~v~5_4_aux_2) (not .cse0)) (or (= v_ULTIMATE.start_main_~v~5_val_0_in_1 v_v_ULTIMATE.start_main_~v~5_4_aux_1) (not .cse1)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (< (mod v_ULTIMATE.start_main_~k~5_4 4294967296) .cse2) (not (< (mod v_ULTIMATE.start_main_~j~5_5 4294967296) .cse2)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= v_v_ULTIMATE.start_main_~v~5_4_aux_2 v_v_ULTIMATE.start_main_~v~5_4_aux_1) 1 0)) (= v_ULTIMATE.start_main_~k~5_4 1) (or .cse0 .cse1))) InVars {ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start_main_~v~5_val_0=v_ULTIMATE.start_main_~v~5_val_0_in_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} OutVars{ULTIMATE.start_main_~v~5_val_0=v_ULTIMATE.start_main_~v~5_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~v~5_idx_0=v_ULTIMATE.start_main_~v~5_idx_0_term_1, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_4, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_4, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_5} AuxVars[v_v_ULTIMATE.start_main_~v~5_4_aux_2, v_v_ULTIMATE.start_main_~v~5_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_~v~5_idx_0, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~k~5] {9#false} is VALID [2019-04-26 16:09:54,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} [16] L42-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9#false} is VALID [2019-04-26 16:09:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-26 16:09:54,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-26 16:09:54,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-26 16:09:54,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-26 16:09:54,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-04-26 16:09:54,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-04-26 16:09:54,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:54,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-26 16:09:54,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-26 16:09:54,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-26 16:09:54,927 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-04-26 16:09:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:55,023 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:09:55,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-26 16:09:55,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-26 16:09:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-26 16:09:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-04-26 16:09:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-04-26 16:09:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-04-26 16:09:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-04-26 16:09:55,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-04-26 16:09:55,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:09:55,111 INFO L225 Difference]: With dead ends: 5 [2019-04-26 16:09:55,111 INFO L226 Difference]: Without dead ends: 5 [2019-04-26 16:09:55,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04-26 16:09:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-04-26 16:09:55,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-04-26 16:09:55,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-04-26 16:09:55,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:55,139 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:55,140 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:55,141 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:09:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:09:55,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:09:55,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:09:55,142 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:55,143 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-04-26 16:09:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:09:55,144 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:09:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:09:55,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:09:55,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:09:55,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-04-26 16:09:55,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-04-26 16:09:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-04-26 16:09:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-04-26 16:09:55,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-04-26 16:09:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-26 16:09:55,149 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-04-26 16:09:55,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-26 16:09:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:09:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-26 16:09:55,150 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:09:55,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-26 16:09:55,150 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:09:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:09:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1325669, now seen corresponding path program 1 times [2019-04-26 16:09:55,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:09:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-26 16:09:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-26 16:09:55,248 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-26 16:09:55,267 INFO L85 mationBacktranslator]: Skipped ATE [13] [13] ULTIMATE.startENTRY-->L53: Formula: (and (= v_ULTIMATE.start_main_~SIZE~5_1 |v_ULTIMATE.start_main_#t~nondet0_3|) (= v_ULTIMATE.start_main_~j~5_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~v~5=v_ULTIMATE.start_main_~v~5_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~SIZE~5=v_ULTIMATE.start_main_~SIZE~5_1, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~k~5=v_ULTIMATE.start_main_~k~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1, ULTIMATE.start_main_~key~5=v_ULTIMATE.start_main_~key~5_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_3|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~v~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~SIZE~5, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~k~5, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~key~5, ULTIMATE.start_main_~i~5] [2019-04-26 16:09:55,268 INFO L85 mationBacktranslator]: Skipped ATE [16] [16] L42-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2019-04-26 16:09:55,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier1,QUANTIFIED] [2019-04-26 16:09:55,287 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-04-26 16:09:55,289 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.04 04:09:55 BasicIcfg [2019-04-26 16:09:55,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-26 16:09:55,290 INFO L168 Benchmark]: Toolchain (without parser) took 1412.59 ms. Allocated memory was 139.5 MB in the beginning and 177.7 MB in the end (delta: 38.3 MB). Free memory was 109.0 MB in the beginning and 147.9 MB in the end (delta: -38.9 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,292 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-04-26 16:09:55,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.00 ms. Allocated memory is still 139.5 MB. Free memory was 109.0 MB in the beginning and 107.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,294 INFO L168 Benchmark]: Boogie Preprocessor took 26.52 ms. Allocated memory is still 139.5 MB. Free memory was 107.2 MB in the beginning and 106.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,295 INFO L168 Benchmark]: RCFGBuilder took 429.79 ms. Allocated memory is still 139.5 MB. Free memory was 106.1 MB in the beginning and 94.6 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,296 INFO L168 Benchmark]: IcfgTransformer took 86.61 ms. Allocated memory is still 139.5 MB. Free memory was 94.6 MB in the beginning and 91.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,297 INFO L168 Benchmark]: TraceAbstraction took 830.26 ms. Allocated memory was 139.5 MB in the beginning and 177.7 MB in the end (delta: 38.3 MB). Free memory was 91.2 MB in the beginning and 147.9 MB in the end (delta: -56.7 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. [2019-04-26 16:09:55,302 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.23 ms. Allocated memory is still 139.5 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.00 ms. Allocated memory is still 139.5 MB. Free memory was 109.0 MB in the beginning and 107.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.52 ms. Allocated memory is still 139.5 MB. Free memory was 107.2 MB in the beginning and 106.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 429.79 ms. Allocated memory is still 139.5 MB. Free memory was 106.1 MB in the beginning and 94.6 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * IcfgTransformer took 86.61 ms. Allocated memory is still 139.5 MB. Free memory was 94.6 MB in the beginning and 91.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 830.26 ms. Allocated memory was 139.5 MB in the beginning and 177.7 MB in the end (delta: 38.3 MB). Free memory was 91.2 MB in the beginning and 147.9 MB in the end (delta: -56.7 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 55]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of IdentityTransformer. Possible FailurePath: [L44] assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); [L45] main_~key~5 := main_~v~5[main_~j~5]; [L46] main_~i~5 := main_~j~5 - 1; [L48] assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5); [L49] main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5]; [L50] main_#t~post1 := main_~j~5; [L51] main_~j~5 := main_#t~post1 + 1; [L52] havoc main_#t~post1; [L33] assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); [L34] main_~k~5 := 1; [L36] assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296); [L37] __VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0); [L38] havoc __VERIFIER_assert_~cond; [L39] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L40] assume __VERIFIER_assert_~cond == 0; [L41] assume !false; VAL [freshIdentifier1=3, main_~i~5=0, main_~j~5=2, main_~key~5=0, main_~SIZE~5=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2 SDtfs, 0 SDslu, 2 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 2 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 3 NumberOfNonLiveVariables, 20 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...