java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:10:16,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:10:16,017 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:10:16,034 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:10:16,034 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:10:16,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:10:16,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:10:16,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:10:16,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:10:16,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:10:16,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:10:16,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:10:16,051 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:10:16,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:10:16,054 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:10:16,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:10:16,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:10:16,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:10:16,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:10:16,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:10:16,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:10:16,076 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:10:16,078 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:10:16,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:10:16,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:10:16,080 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:10:16,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:10:16,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:10:16,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:10:16,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:10:16,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:10:16,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:10:16,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:10:16,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:10:16,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:10:16,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:10:16,087 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 10:10:16,099 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:10:16,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:10:16,100 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:10:16,100 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:10:16,101 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:10:16,101 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:10:16,101 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:10:16,101 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:10:16,101 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:10:16,101 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:10:16,102 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:10:16,102 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:10:16,102 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:10:16,102 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:10:16,103 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:10:16,103 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:10:16,103 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:10:16,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:10:16,104 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:10:16,104 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:10:16,104 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:10:16,104 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:10:16,104 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:10:16,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:10:16,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:10:16,105 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:10:16,105 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:10:16,105 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:10:16,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:10:16,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:10:16,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:10:16,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:16,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:10:16,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:10:16,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:10:16,107 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:10:16,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:10:16,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:10:16,108 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:10:16,108 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:10:16,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:10:16,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:10:16,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:10:16,153 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:10:16,154 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:10:16,155 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl [2019-02-28 10:10:16,155 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl' [2019-02-28 10:10:16,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:10:16,198 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:10:16,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:16,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:10:16,199 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:10:16,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (1/1) ... [2019-02-28 10:10:16,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (1/1) ... [2019-02-28 10:10:16,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:16,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:10:16,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:10:16,236 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:10:16,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (1/1) ... [2019-02-28 10:10:16,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (1/1) ... [2019-02-28 10:10:16,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (1/1) ... [2019-02-28 10:10:16,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (1/1) ... [2019-02-28 10:10:16,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (1/1) ... [2019-02-28 10:10:16,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (1/1) ... [2019-02-28 10:10:16,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (1/1) ... [2019-02-28 10:10:16,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:10:16,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:10:16,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:10:16,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:10:16,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:10:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:10:16,678 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:10:16,679 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 10:10:16,680 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:16 BoogieIcfgContainer [2019-02-28 10:10:16,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:10:16,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:10:16,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:10:16,686 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:10:16,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:16" (1/2) ... [2019-02-28 10:10:16,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7a7d35 and model type linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:10:16, skipping insertion in model container [2019-02-28 10:10:16,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:16" (2/2) ... [2019-02-28 10:10:16,691 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search.i_5.bpl [2019-02-28 10:10:16,702 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:10:16,710 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:10:16,731 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:10:16,772 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:10:16,772 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:10:16,772 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:10:16,773 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:10:16,773 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:10:16,773 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:10:16,773 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:10:16,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:10:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 10:10:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:10:16,805 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:16,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:10:16,809 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:16,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-02-28 10:10:16,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:16,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:16,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:17,473 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 16 [2019-02-28 10:10:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:17,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:10:17,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:17,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:17,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:17,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:17,544 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-02-28 10:10:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:17,718 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-02-28 10:10:17,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:10:17,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:10:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:17,732 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:10:17,732 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:10:17,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:10:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:10:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 10:10:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:10:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-28 10:10:17,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-02-28 10:10:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:17,772 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-28 10:10:17,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 10:10:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:10:17,773 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:17,773 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-28 10:10:17,774 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-02-28 10:10:17,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:18,385 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2019-02-28 10:10:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:10:18,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:18,425 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:10:18,426 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [8], [10] [2019-02-28 10:10:18,471 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:18,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:18,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:10:18,688 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 340 root evaluator evaluations with a maximum evaluation depth of 9. Performed 340 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:10:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:18,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:10:18,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:18,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:18,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:18,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:10:18,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:19,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:19,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:19,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2019-02-28 10:10:19,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:19,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:10:19,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:10:19,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:10:19,259 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-02-28 10:10:19,712 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-02-28 10:10:20,100 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-28 10:10:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:20,102 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-28 10:10:20,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:10:20,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-28 10:10:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:20,103 INFO L225 Difference]: With dead ends: 9 [2019-02-28 10:10:20,103 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:10:20,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:10:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:10:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:10:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:10:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:10:20,106 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-28 10:10:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:20,106 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:10:20,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:10:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:10:20,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:10:20,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:10:20,350 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-02-28 10:10:20,428 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 11 103) no Hoare annotation was computed. [2019-02-28 10:10:20,428 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 11 103) no Hoare annotation was computed. [2019-02-28 10:10:20,428 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 11 103) no Hoare annotation was computed. [2019-02-28 10:10:20,429 INFO L444 ceAbstractionStarter]: At program point L91(lines 91 101) the Hoare annotation is: false [2019-02-28 10:10:20,429 INFO L444 ceAbstractionStarter]: At program point L75(lines 75 92) the Hoare annotation is: (let ((.cse2 (div ~SIZE 4294967296))) (let ((.cse0 (* 4294967296 .cse2))) (and (let ((.cse1 (div ULTIMATE.start_linear_search_~n 4294967296))) (or (and (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n)) (< 0 (+ .cse1 .cse2 1))) (and (<= .cse2 0) (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n 4294967296)) (< 0 (+ .cse1 .cse2 2))))) (<= (+ ULTIMATE.start_linear_search_~j~5 .cse0 1) (+ (* 4294967296 (div ULTIMATE.start_linear_search_~j~5 4294967296)) ~SIZE))))) [2019-02-28 10:10:20,429 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 102) no Hoare annotation was computed. [2019-02-28 10:10:20,430 INFO L444 ceAbstractionStarter]: At program point L100(lines 65 100) the Hoare annotation is: (let ((.cse2 (div ~SIZE 4294967296))) (let ((.cse0 (* 4294967296 .cse2)) (.cse1 (div ULTIMATE.start_linear_search_~n 4294967296))) (or (and (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n)) (< 0 (+ .cse1 .cse2 1))) (and (<= .cse2 0) (= ~SIZE (+ .cse0 ULTIMATE.start_linear_search_~n 4294967296)) (< 0 (+ .cse1 .cse2 2)))))) [2019-02-28 10:10:20,441 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:10:20 BoogieIcfgContainer [2019-02-28 10:10:20,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:10:20,442 INFO L168 Benchmark]: Toolchain (without parser) took 4244.53 ms. Allocated memory was 139.5 MB in the beginning and 217.6 MB in the end (delta: 78.1 MB). Free memory was 105.6 MB in the beginning and 141.8 MB in the end (delta: -36.2 MB). Peak memory consumption was 41.9 MB. Max. memory is 7.1 GB. [2019-02-28 10:10:20,443 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:10:20,443 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.02 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 103.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-02-28 10:10:20,445 INFO L168 Benchmark]: Boogie Preprocessor took 23.78 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 102.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-28 10:10:20,446 INFO L168 Benchmark]: RCFGBuilder took 420.69 ms. Allocated memory is still 139.5 MB. Free memory was 102.4 MB in the beginning and 90.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-02-28 10:10:20,446 INFO L168 Benchmark]: TraceAbstraction took 3759.53 ms. Allocated memory was 139.5 MB in the beginning and 217.6 MB in the end (delta: 78.1 MB). Free memory was 90.2 MB in the beginning and 141.8 MB in the end (delta: -51.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-02-28 10:10:20,452 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.02 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 103.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.78 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 102.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 420.69 ms. Allocated memory is still 139.5 MB. Free memory was 102.4 MB in the beginning and 90.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3759.53 ms. Allocated memory was 139.5 MB in the beginning and 217.6 MB in the end (delta: 78.1 MB). Free memory was 90.2 MB in the beginning and 141.8 MB in the end (delta: -51.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n && 0 < linear_search_~n / 4294967296 + ~SIZE / 4294967296 + 1) || ((~SIZE / 4294967296 <= 0 && ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n + 4294967296) && 0 < linear_search_~n / 4294967296 + ~SIZE / 4294967296 + 2)) && linear_search_~j~5 + 4294967296 * (~SIZE / 4294967296) + 1 <= 4294967296 * (linear_search_~j~5 / 4294967296) + ~SIZE - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n && 0 < linear_search_~n / 4294967296 + ~SIZE / 4294967296 + 1) || ((~SIZE / 4294967296 <= 0 && ~SIZE == 4294967296 * (~SIZE / 4294967296) + linear_search_~n + 4294967296) && 0 < linear_search_~n / 4294967296 + ~SIZE / 4294967296 + 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 3.6s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 2 SDslu, 2 SDs, 0 SdLazy, 22 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 7 NumberOfFragments, 112 HoareAnnotationTreeSize, 3 FomulaSimplifications, 48 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 344 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 1893 SizeOfPredicates, 2 NumberOfNonLiveVariables, 94 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...