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/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:56:00,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:56:00,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:56:00,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:56:00,130 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:56:00,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:56:00,132 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:56:00,135 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:56:00,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:56:00,138 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:56:00,139 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:56:00,139 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:56:00,140 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:56:00,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:56:00,143 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:56:00,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:56:00,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:56:00,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:56:00,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:56:00,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:56:00,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:56:00,154 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:56:00,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:56:00,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:56:00,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:56:00,158 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:56:00,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:56:00,160 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:56:00,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:56:00,162 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:56:00,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:56:00,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:56:00,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:56:00,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:56:00,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:56:00,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:56:00,167 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:56:00,168 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:56:00,169 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:00,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:00,212 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:00,217 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:00,218 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:00,219 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:00,221 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-05-15 10:56:00,221 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-05-15 10:56:00,272 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:00,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:00,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:00,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:00,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:00,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:00,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:00,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:00,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:00,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (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:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:56:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:56:00,720 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:56:00,721 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:56:00,722 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:00 BoogieIcfgContainer [2019-05-15 10:56:00,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:00,723 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:00,723 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:00,724 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:00,728 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,833 INFO L632 onniauxMapEliminator]: L35 [2019-05-15 10:56:00,838 INFO L633 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 (not (= 1023 (select v_ULTIMATE.start_main_~A~4_4 1023))) 1 0)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (not (< v_ULTIMATE.start_main_~i~4_6 1024))) InVars {ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_4, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_4, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-05-15 10:56:00,839 INFO L634 onniauxMapEliminator]: Out Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or (= 1023 v_ULTIMATE.start_main_~A~4_idx_0_term_1) (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (or (not (= 1023 v_ULTIMATE.start_main_~A~4_idx_0_term_1)) (= v_ULTIMATE.start_main_~A~4_val_0_in_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (not (= 1023 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) 1 0)) (not (< v_ULTIMATE.start_main_~i~4_6 1024)) v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[v_v_ULTIMATE.start_main_~A~4_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] [2019-05-15 10:56:00,839 INFO L635 onniauxMapEliminator]: L28 [2019-05-15 10:56:00,871 INFO L632 onniauxMapEliminator]: L35 [2019-05-15 10:56:00,871 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_ULTIMATE.start_main_~A~4_5 (store v_ULTIMATE.start_main_~A~4_6 v_ULTIMATE.start_main_~i~4_8 v_ULTIMATE.start_main_~i~4_8)) (= v_ULTIMATE.start_main_~i~4_7 (+ v_ULTIMATE.start_main_~i~4_8 1)) (< v_ULTIMATE.start_main_~i~4_8 1024)) InVars {ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_6, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_8} OutVars{ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_5, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~A~4, ULTIMATE.start_main_~i~4] [2019-05-15 10:56:00,871 INFO L634 onniauxMapEliminator]: Out Formula: (and (= v_ULTIMATE.start_main_~A~4_val_0_out_1 v_ULTIMATE.start_main_~A~4_val_0_in_2) (= v_ULTIMATE.start_main_~i~4_7 (+ v_ULTIMATE.start_main_~i~4_8 1)) (or (= v_ULTIMATE.start_main_~A~4_val_0_in_2 v_ULTIMATE.start_main_~i~4_8) (not (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8))) (< v_ULTIMATE.start_main_~i~4_8 1024) v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1 (or (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8) (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1))) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_2, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_8} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_out_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~A~4_val_0, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4] [2019-05-15 10:56:00,872 INFO L635 onniauxMapEliminator]: L35 [2019-05-15 10:56:00,921 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:00 BasicIcfg [2019-05-15 10:56:00,921 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:00,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:00,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:00,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:00,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/3) ... [2019-05-15 10:56:00,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4f6218 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:56:00, skipping insertion in model container [2019-05-15 10:56:00,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:00" (2/3) ... [2019-05-15 10:56:00,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4f6218 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:00, skipping insertion in model container [2019-05-15 10:56:00,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:00" (3/3) ... [2019-05-15 10:56:00,933 INFO L109 eAbstractionObserver]: Analyzing ICFG array1.i_3.bplME [2019-05-15 10:56:00,944 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:00,955 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:56:00,973 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:56:01,002 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:01,003 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:01,003 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:01,003 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:01,003 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:01,003 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:01,004 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:01,004 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:01,004 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-05-15 10:56:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-05-15 10:56:01,026 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:01,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-05-15 10:56:01,030 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash 42734, now seen corresponding path program 1 times [2019-05-15 10:56:01,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-15 10:56:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:01,249 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} [13] ULTIMATE.startENTRY-->L35: Formula: (= v_ULTIMATE.start_main_~i~4_1 0) InVars {} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, ULTIMATE.start_main_~A~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4] {13#(<= ULTIMATE.start_main_~i~4 0)} is VALID [2019-05-15 10:56:01,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(<= ULTIMATE.start_main_~i~4 0)} [14] L35-->L28: Formula: (let ((.cse0 (= 1023 v_ULTIMATE.start_main_~A~4_idx_0_term_1))) (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or .cse0 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (or (not .cse0) (= v_ULTIMATE.start_main_~A~4_val_0_in_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (not (= 1023 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) 1 0)) (not (< v_ULTIMATE.start_main_~i~4_6 1024)) v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[v_v_ULTIMATE.start_main_~A~4_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {9#false} is VALID [2019-05-15 10:56:01,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} [16] L28-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9#false} is VALID [2019-05-15 10:56:01,264 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:01,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:01,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:56:01,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:01,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:01,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:01,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:01,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:01,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:01,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:01,334 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-05-15 10:56:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,429 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:01,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-05-15 10:56:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-05-15 10:56:01,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-05-15 10:56:01,480 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:01,491 INFO L225 Difference]: With dead ends: 5 [2019-05-15 10:56:01,491 INFO L226 Difference]: Without dead ends: 5 [2019-05-15 10:56:01,493 INFO L628 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-05-15 10:56:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-05-15 10:56:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-05-15 10:56:01,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:01,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,522 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,522 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,524 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:01,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,525 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,526 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,527 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:01,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:01,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:56:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-05-15 10:56:01,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-05-15 10:56:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:01,532 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-05-15 10:56:01,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:56:01,533 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:01,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:56:01,533 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:01,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:01,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1325669, now seen corresponding path program 1 times [2019-05-15 10:56:01,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:56:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:01,792 INFO L273 TraceCheckUtils]: 0: Hoare triple {39#true} [13] ULTIMATE.startENTRY-->L35: Formula: (= v_ULTIMATE.start_main_~i~4_1 0) InVars {} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~A~4=v_ULTIMATE.start_main_~A~4_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, ULTIMATE.start_main_~A~4, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4] {44#(<= ULTIMATE.start_main_~i~4 0)} is VALID [2019-05-15 10:56:01,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#(<= ULTIMATE.start_main_~i~4 0)} [15] L35-->L35: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~A~4_idx_0_term_2 v_ULTIMATE.start_main_~i~4_8))) (and (= v_ULTIMATE.start_main_~A~4_val_0_out_1 v_ULTIMATE.start_main_~A~4_val_0_in_2) (= v_ULTIMATE.start_main_~i~4_7 (+ v_ULTIMATE.start_main_~i~4_8 1)) (or (= v_ULTIMATE.start_main_~A~4_val_0_in_2 v_ULTIMATE.start_main_~i~4_8) (not .cse0)) (< v_ULTIMATE.start_main_~i~4_8 1024) v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1 (or .cse0 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)))) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_2, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_8} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_2, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_out_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~A~4_val_0, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~i~4] {48#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} is VALID [2019-05-15 10:56:01,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(and (<= ULTIMATE.start_main_~A~4_idx_0 0) ULTIMATE.start_main_~A~4_idx_0_bool)} [14] L35-->L28: Formula: (let ((.cse0 (= 1023 v_ULTIMATE.start_main_~A~4_idx_0_term_1))) (and (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (or .cse0 (not v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (or (not .cse0) (= v_ULTIMATE.start_main_~A~4_val_0_in_1 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (not (= 1023 v_v_ULTIMATE.start_main_~A~4_4_aux_1)) 1 0)) (not (< v_ULTIMATE.start_main_~i~4_6 1024)) v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1)) InVars {ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} OutVars{ULTIMATE.start_main_~A~4_idx_0=v_ULTIMATE.start_main_~A~4_idx_0_term_1, ULTIMATE.start_main_~A~4_val_0=v_ULTIMATE.start_main_~A~4_val_0_in_1, ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~A~4_idx_0_bool=v_ULTIMATE.start_main_~A~4_idx_0_term_assigned_1, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~i~4=v_ULTIMATE.start_main_~i~4_6} AuxVars[v_v_ULTIMATE.start_main_~A~4_4_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond] {40#false} is VALID [2019-05-15 10:56:01,836 INFO L273 TraceCheckUtils]: 3: Hoare triple {40#false} [16] L28-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2019-05-15 10:56:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:01,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:56:01,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-15 10:56:01,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:56:01,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:01,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:56:01,864 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:01,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:56:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:56:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:01,865 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-05-15 10:56:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,920 INFO L93 Difference]: Finished difference Result 3 states and 3 transitions. [2019-05-15 10:56:01,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:56:01,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:56:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-15 10:56:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-15 10:56:01,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4 transitions. [2019-05-15 10:56:01,974 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:01,974 INFO L225 Difference]: With dead ends: 3 [2019-05-15 10:56:01,974 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:56:01,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:56:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:56:01,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:01,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:01,976 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:01,977 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,977 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:01,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,978 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:01,978 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,979 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:01,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:01,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:56:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:56:01,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-05-15 10:56:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:01,981 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:56:01,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:56:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:01,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,985 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:01,987 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:01 BasicIcfg [2019-05-15 10:56:01,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:01,988 INFO L168 Benchmark]: Toolchain (without parser) took 1715.12 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 111.8 MB in the beginning and 138.7 MB in the end (delta: -27.0 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,991 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.32 ms. Allocated memory is still 134.2 MB. Free memory is still 113.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:01,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.38 ms. Allocated memory is still 134.2 MB. Free memory was 111.5 MB in the beginning and 109.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,992 INFO L168 Benchmark]: Boogie Preprocessor took 24.24 ms. Allocated memory is still 134.2 MB. Free memory was 109.9 MB in the beginning and 108.9 MB in the end (delta: 967.0 kB). Peak memory consumption was 967.0 kB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,994 INFO L168 Benchmark]: RCFGBuilder took 376.37 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 98.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,995 INFO L168 Benchmark]: IcfgTransformer took 198.45 ms. Allocated memory is still 134.2 MB. Free memory was 98.6 MB in the beginning and 95.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,995 INFO L168 Benchmark]: TraceAbstraction took 1064.34 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 94.9 MB in the beginning and 138.7 MB in the end (delta: -43.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:02,001 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.32 ms. Allocated memory is still 134.2 MB. Free memory is still 113.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.38 ms. Allocated memory is still 134.2 MB. Free memory was 111.5 MB in the beginning and 109.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.24 ms. Allocated memory is still 134.2 MB. Free memory was 109.9 MB in the beginning and 108.9 MB in the end (delta: 967.0 kB). Peak memory consumption was 967.0 kB. Max. memory is 7.1 GB. * RCFGBuilder took 376.37 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 98.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 198.45 ms. Allocated memory is still 134.2 MB. Free memory was 98.6 MB in the beginning and 95.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1064.34 ms. Allocated memory was 134.2 MB in the beginning and 170.4 MB in the end (delta: 36.2 MB). Free memory was 94.9 MB in the beginning and 138.7 MB in the end (delta: -43.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: 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, 5 locations, 1 error locations. SAFE Result, 0.9s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3 SDtfs, 1 SDslu, 3 SDs, 0 SdLazy, 8 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 35 SizeOfPredicates, 3 NumberOfNonLiveVariables, 38 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...