java -ea -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_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c30ebe1 [2018-12-17 14:29:57,247 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-17 14:29:57,249 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-17 14:29:57,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-17 14:29:57,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-17 14:29:57,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-17 14:29:57,269 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-17 14:29:57,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-17 14:29:57,273 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-17 14:29:57,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-17 14:29:57,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-17 14:29:57,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-17 14:29:57,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-17 14:29:57,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-17 14:29:57,285 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-17 14:29:57,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-17 14:29:57,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-17 14:29:57,290 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-17 14:29:57,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-17 14:29:57,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-17 14:29:57,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-17 14:29:57,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-17 14:29:57,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-17 14:29:57,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-17 14:29:57,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-17 14:29:57,307 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-17 14:29:57,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-17 14:29:57,311 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-17 14:29:57,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-17 14:29:57,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-17 14:29:57,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-17 14:29:57,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-17 14:29:57,315 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-17 14:29:57,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-17 14:29:57,317 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-17 14:29:57,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-17 14:29:57,317 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-17 14:29:57,342 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-17 14:29:57,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-17 14:29:57,345 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-17 14:29:57,346 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-17 14:29:57,346 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-17 14:29:57,346 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-17 14:29:57,346 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-17 14:29:57,346 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-17 14:29:57,352 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-17 14:29:57,352 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-17 14:29:57,352 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-17 14:29:57,352 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-17 14:29:57,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-17 14:29:57,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-17 14:29:57,354 INFO L133 SettingsManager]: * Use SBE=true [2018-12-17 14:29:57,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-17 14:29:57,355 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-17 14:29:57,356 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-17 14:29:57,356 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-17 14:29:57,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-17 14:29:57,356 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-17 14:29:57,356 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-17 14:29:57,357 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-17 14:29:57,357 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-17 14:29:57,357 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-17 14:29:57,357 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-17 14:29:57,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-17 14:29:57,358 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-17 14:29:57,358 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-17 14:29:57,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-17 14:29:57,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-17 14:29:57,358 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-17 14:29:57,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-17 14:29:57,361 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-17 14:29:57,362 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-17 14:29:57,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-17 14:29:57,362 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-17 14:29:57,362 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-17 14:29:57,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-17 14:29:57,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-17 14:29:57,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-17 14:29:57,446 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-17 14:29:57,446 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-17 14:29:57,448 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2018-12-17 14:29:57,448 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2018-12-17 14:29:57,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-17 14:29:57,503 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-17 14:29:57,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-17 14:29:57,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-17 14:29:57,504 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-17 14:29:57,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (1/1) ... [2018-12-17 14:29:57,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (1/1) ... [2018-12-17 14:29:57,537 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-17 14:29:57,537 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-17 14:29:57,538 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-17 14:29:57,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-17 14:29:57,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-17 14:29:57,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-17 14:29:57,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-17 14:29:57,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (1/1) ... [2018-12-17 14:29:57,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (1/1) ... [2018-12-17 14:29:57,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (1/1) ... [2018-12-17 14:29:57,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (1/1) ... [2018-12-17 14:29:57,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (1/1) ... [2018-12-17 14:29:57,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (1/1) ... [2018-12-17 14:29:57,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (1/1) ... [2018-12-17 14:29:57,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-17 14:29:57,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-17 14:29:57,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-17 14:29:57,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-17 14:29:57,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-17 14:29:57,626 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-12-17 14:29:57,626 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-12-17 14:29:57,938 INFO L272 CfgBuilder]: Using library mode [2018-12-17 14:29:57,939 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-17 14:29:57,939 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:29:57 BoogieIcfgContainer [2018-12-17 14:29:57,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-17 14:29:57,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-17 14:29:57,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-17 14:29:57,944 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-17 14:29:57,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:57" (1/2) ... [2018-12-17 14:29:57,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5850f750 and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:29:57, skipping insertion in model container [2018-12-17 14:29:57,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:29:57" (2/2) ... [2018-12-17 14:29:57,947 INFO L112 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2018-12-17 14:29:57,956 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-17 14:29:57,968 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-17 14:29:57,990 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-17 14:29:58,020 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-17 14:29:58,020 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-17 14:29:58,020 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-17 14:29:58,020 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-17 14:29:58,021 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-17 14:29:58,021 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-17 14:29:58,021 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-17 14:29:58,021 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-17 14:29:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-12-17 14:29:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-17 14:29:58,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:29:58,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-17 14:29:58,044 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:29:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:29:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2018-12-17 14:29:58,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:29:58,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:29:58,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:29:58,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:29:58,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:29:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:29:58,289 INFO L273 TraceCheckUtils]: 0: Hoare triple {7#true} i := 0; {9#(<= proc_i 0)} is VALID [2018-12-17 14:29:58,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {9#(<= proc_i 0)} assume !(i <= 1000); {8#false} is VALID [2018-12-17 14:29:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:29:58,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-17 14:29:58,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-17 14:29:58,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:29:58,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-17 14:29:58,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:29:58,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-17 14:29:58,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:29:58,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-17 14:29:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-17 14:29:58,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:29:58,367 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-12-17 14:29:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:29:58,455 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-17 14:29:58,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-17 14:29:58,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-17 14:29:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:29:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:29:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-17 14:29:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:29:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-17 14:29:58,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2018-12-17 14:29:58,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:29:58,544 INFO L225 Difference]: With dead ends: 7 [2018-12-17 14:29:58,544 INFO L226 Difference]: Without dead ends: 4 [2018-12-17 14:29:58,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:29:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-12-17 14:29:58,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-12-17 14:29:58,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:29:58,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4 states. Second operand 4 states. [2018-12-17 14:29:58,577 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2018-12-17 14:29:58,577 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2018-12-17 14:29:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:29:58,578 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2018-12-17 14:29:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-12-17 14:29:58,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:29:58,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:29:58,579 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2018-12-17 14:29:58,580 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2018-12-17 14:29:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:29:58,581 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2018-12-17 14:29:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-12-17 14:29:58,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:29:58,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:29:58,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:29:58,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:29:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-17 14:29:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-12-17 14:29:58,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-12-17 14:29:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:29:58,585 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-12-17 14:29:58,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-17 14:29:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-12-17 14:29:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-17 14:29:58,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:29:58,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-17 14:29:58,586 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:29:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:29:58,587 INFO L82 PathProgramCache]: Analyzing trace with hash 29950, now seen corresponding path program 1 times [2018-12-17 14:29:58,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:29:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:29:58,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:29:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:29:58,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:29:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:29:58,681 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {37#(<= proc_i 0)} is VALID [2018-12-17 14:29:58,683 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {38#(<= proc_i 4)} is VALID [2018-12-17 14:29:58,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#(<= proc_i 4)} assume !(i <= 1000); {36#false} is VALID [2018-12-17 14:29:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:29:58,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:29:58,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:29:58,694 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-17 14:29:58,696 INFO L207 CegarAbsIntRunner]: [0], [4], [5] [2018-12-17 14:29:58,749 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-17 14:29:58,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-17 14:30:15,825 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-17 14:30:15,827 INFO L272 AbstractInterpreter]: Visited 3 different actions 17 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-17 14:30:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:30:15,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-17 14:30:15,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:30:15,834 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 [2018-12-17 14:30:15,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:30:15,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-17 14:30:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:15,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-17 14:30:16,045 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {37#(<= proc_i 0)} is VALID [2018-12-17 14:30:16,046 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {38#(<= proc_i 4)} is VALID [2018-12-17 14:30:16,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#(<= proc_i 4)} assume !(i <= 1000); {36#false} is VALID [2018-12-17 14:30:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:16,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-17 14:30:16,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= proc_i 1000)} assume !(i <= 1000); {36#false} is VALID [2018-12-17 14:30:16,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#(< proc_i 997)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {48#(<= proc_i 1000)} is VALID [2018-12-17 14:30:16,152 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {52#(< proc_i 997)} is VALID [2018-12-17 14:30:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:16,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-17 14:30:16,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2018-12-17 14:30:16,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-17 14:30:16,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-17 14:30:16,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:30:16,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-17 14:30:16,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:30:16,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-17 14:30:16,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-17 14:30:16,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-17 14:30:16,220 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-12-17 14:30:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:16,259 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-17 14:30:16,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-17 14:30:16,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-17 14:30:16,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:30:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-17 14:30:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-12-17 14:30:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-17 14:30:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-12-17 14:30:16,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 6 transitions. [2018-12-17 14:30:16,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:30:16,279 INFO L225 Difference]: With dead ends: 6 [2018-12-17 14:30:16,279 INFO L226 Difference]: Without dead ends: 5 [2018-12-17 14:30:16,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-17 14:30:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-17 14:30:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-17 14:30:16,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:30:16,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2018-12-17 14:30:16,284 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-17 14:30:16,285 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-17 14:30:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:16,286 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-17 14:30:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-17 14:30:16,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:16,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:30:16,287 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-17 14:30:16,287 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-17 14:30:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:16,288 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-17 14:30:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-17 14:30:16,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:16,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:30:16,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:30:16,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:30:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-17 14:30:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-17 14:30:16,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-17 14:30:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:30:16,291 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-17 14:30:16,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-17 14:30:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-17 14:30:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-17 14:30:16,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:30:16,291 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-12-17 14:30:16,292 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:30:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:30:16,292 INFO L82 PathProgramCache]: Analyzing trace with hash 928485, now seen corresponding path program 2 times [2018-12-17 14:30:16,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:30:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:30:16,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:30:16,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:30:16,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:30:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:16,364 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {84#(<= proc_i 0)} is VALID [2018-12-17 14:30:16,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {84#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {85#(<= proc_i 4)} is VALID [2018-12-17 14:30:16,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {85#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {86#(<= proc_i 8)} is VALID [2018-12-17 14:30:16,367 INFO L273 TraceCheckUtils]: 3: Hoare triple {86#(<= proc_i 8)} assume !(i <= 1000); {83#false} is VALID [2018-12-17 14:30:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:16,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:30:16,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:30:16,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-17 14:30:16,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-17 14:30:16,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:30:16,369 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-17 14:30:16,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-17 14:30:16,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-17 14:30:16,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-17 14:30:16,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-17 14:30:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:16,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-17 14:30:16,437 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {84#(<= proc_i 0)} is VALID [2018-12-17 14:30:16,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {84#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {85#(<= proc_i 4)} is VALID [2018-12-17 14:30:16,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {85#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {86#(<= proc_i 8)} is VALID [2018-12-17 14:30:16,440 INFO L273 TraceCheckUtils]: 3: Hoare triple {86#(<= proc_i 8)} assume !(i <= 1000); {83#false} is VALID [2018-12-17 14:30:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:16,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-17 14:30:16,488 INFO L273 TraceCheckUtils]: 3: Hoare triple {99#(<= proc_i 1000)} assume !(i <= 1000); {83#false} is VALID [2018-12-17 14:30:16,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {103#(< proc_i 997)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {99#(<= proc_i 1000)} is VALID [2018-12-17 14:30:16,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {107#(< proc_i 993)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {103#(< proc_i 997)} is VALID [2018-12-17 14:30:16,492 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {107#(< proc_i 993)} is VALID [2018-12-17 14:30:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:16,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-17 14:30:16,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-17 14:30:16,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-17 14:30:16,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-17 14:30:16,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:30:16,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-12-17 14:30:16,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:30:16,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-17 14:30:16,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-17 14:30:16,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-17 14:30:16,519 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-17 14:30:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:16,791 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-17 14:30:16,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-17 14:30:16,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-17 14:30:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:30:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-17 14:30:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-12-17 14:30:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-17 14:30:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-12-17 14:30:16,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 7 transitions. [2018-12-17 14:30:16,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:30:16,847 INFO L225 Difference]: With dead ends: 7 [2018-12-17 14:30:16,847 INFO L226 Difference]: Without dead ends: 6 [2018-12-17 14:30:16,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-17 14:30:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-17 14:30:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-17 14:30:16,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:30:16,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2018-12-17 14:30:16,860 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-17 14:30:16,860 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-17 14:30:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:16,861 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-17 14:30:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-17 14:30:16,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:16,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:30:16,862 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-17 14:30:16,862 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-17 14:30:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:16,863 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-17 14:30:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-17 14:30:16,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:16,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:30:16,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:30:16,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:30:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-17 14:30:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-17 14:30:16,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-17 14:30:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:30:16,865 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-17 14:30:16,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-17 14:30:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-17 14:30:16,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-17 14:30:16,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:30:16,866 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-12-17 14:30:16,867 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:30:16,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:30:16,867 INFO L82 PathProgramCache]: Analyzing trace with hash 28783070, now seen corresponding path program 3 times [2018-12-17 14:30:16,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:30:16,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:30:16,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-17 14:30:16,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:30:16,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:30:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:16,937 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {145#(<= proc_i 0)} is VALID [2018-12-17 14:30:16,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {145#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {146#(<= proc_i 4)} is VALID [2018-12-17 14:30:16,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {146#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {147#(<= proc_i 8)} is VALID [2018-12-17 14:30:16,940 INFO L273 TraceCheckUtils]: 3: Hoare triple {147#(<= proc_i 8)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {148#(<= proc_i 12)} is VALID [2018-12-17 14:30:16,942 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#(<= proc_i 12)} assume !(i <= 1000); {144#false} is VALID [2018-12-17 14:30:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:16,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:30:16,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:30:16,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-17 14:30:16,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-17 14:30:16,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:30:16,944 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-17 14:30:16,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-17 14:30:16,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-17 14:30:16,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-17 14:30:16,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-17 14:30:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:16,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-17 14:30:17,043 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {145#(<= proc_i 0)} is VALID [2018-12-17 14:30:17,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {145#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {146#(<= proc_i 4)} is VALID [2018-12-17 14:30:17,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {146#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {147#(<= proc_i 8)} is VALID [2018-12-17 14:30:17,086 INFO L273 TraceCheckUtils]: 3: Hoare triple {147#(<= proc_i 8)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {148#(<= proc_i 12)} is VALID [2018-12-17 14:30:17,100 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#(<= proc_i 12)} assume !(i <= 1000); {144#false} is VALID [2018-12-17 14:30:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:17,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-17 14:30:17,231 INFO L273 TraceCheckUtils]: 4: Hoare triple {164#(<= proc_i 1000)} assume !(i <= 1000); {144#false} is VALID [2018-12-17 14:30:17,240 INFO L273 TraceCheckUtils]: 3: Hoare triple {168#(< proc_i 997)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {164#(<= proc_i 1000)} is VALID [2018-12-17 14:30:17,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {172#(< proc_i 993)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {168#(< proc_i 997)} is VALID [2018-12-17 14:30:17,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {176#(< proc_i 989)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {172#(< proc_i 993)} is VALID [2018-12-17 14:30:17,245 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {176#(< proc_i 989)} is VALID [2018-12-17 14:30:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:17,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-17 14:30:17,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-17 14:30:17,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-17 14:30:17,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-17 14:30:17,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:30:17,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-17 14:30:17,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:30:17,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-17 14:30:17,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-17 14:30:17,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-17 14:30:17,275 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-17 14:30:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:17,307 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-17 14:30:17,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-17 14:30:17,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-17 14:30:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:30:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-17 14:30:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2018-12-17 14:30:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-17 14:30:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2018-12-17 14:30:17,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 8 transitions. [2018-12-17 14:30:17,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:30:17,326 INFO L225 Difference]: With dead ends: 8 [2018-12-17 14:30:17,327 INFO L226 Difference]: Without dead ends: 7 [2018-12-17 14:30:17,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-17 14:30:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-17 14:30:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-17 14:30:17,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:30:17,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-17 14:30:17,337 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-17 14:30:17,337 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-17 14:30:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:17,338 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-17 14:30:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-17 14:30:17,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:17,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:30:17,338 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-17 14:30:17,339 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-17 14:30:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:17,339 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-17 14:30:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-17 14:30:17,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:17,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:30:17,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:30:17,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:30:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-17 14:30:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-17 14:30:17,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-17 14:30:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:30:17,341 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-17 14:30:17,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-17 14:30:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-17 14:30:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-17 14:30:17,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:30:17,342 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-12-17 14:30:17,342 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:30:17,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:30:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash 892275205, now seen corresponding path program 4 times [2018-12-17 14:30:17,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:30:17,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:30:17,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-17 14:30:17,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:30:17,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:30:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:17,434 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {220#(<= proc_i 0)} is VALID [2018-12-17 14:30:17,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {221#(<= proc_i 4)} is VALID [2018-12-17 14:30:17,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {221#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {222#(<= proc_i 8)} is VALID [2018-12-17 14:30:17,438 INFO L273 TraceCheckUtils]: 3: Hoare triple {222#(<= proc_i 8)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {223#(<= proc_i 12)} is VALID [2018-12-17 14:30:17,440 INFO L273 TraceCheckUtils]: 4: Hoare triple {223#(<= proc_i 12)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {224#(<= proc_i 16)} is VALID [2018-12-17 14:30:17,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(<= proc_i 16)} assume !(i <= 1000); {219#false} is VALID [2018-12-17 14:30:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:17,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:30:17,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:30:17,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-17 14:30:17,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-17 14:30:17,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:30:17,443 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-17 14:30:17,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:30:17,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-17 14:30:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:17,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-17 14:30:17,601 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {220#(<= proc_i 0)} is VALID [2018-12-17 14:30:17,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {221#(<= proc_i 4)} is VALID [2018-12-17 14:30:17,611 INFO L273 TraceCheckUtils]: 2: Hoare triple {221#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {222#(<= proc_i 8)} is VALID [2018-12-17 14:30:17,613 INFO L273 TraceCheckUtils]: 3: Hoare triple {222#(<= proc_i 8)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {223#(<= proc_i 12)} is VALID [2018-12-17 14:30:17,614 INFO L273 TraceCheckUtils]: 4: Hoare triple {223#(<= proc_i 12)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {224#(<= proc_i 16)} is VALID [2018-12-17 14:30:17,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(<= proc_i 16)} assume !(i <= 1000); {219#false} is VALID [2018-12-17 14:30:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:17,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-17 14:30:17,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {243#(<= proc_i 1000)} assume !(i <= 1000); {219#false} is VALID [2018-12-17 14:30:17,906 INFO L273 TraceCheckUtils]: 4: Hoare triple {247#(< proc_i 997)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {243#(<= proc_i 1000)} is VALID [2018-12-17 14:30:17,911 INFO L273 TraceCheckUtils]: 3: Hoare triple {251#(< proc_i 993)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {247#(< proc_i 997)} is VALID [2018-12-17 14:30:17,912 INFO L273 TraceCheckUtils]: 2: Hoare triple {255#(< proc_i 989)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {251#(< proc_i 993)} is VALID [2018-12-17 14:30:17,912 INFO L273 TraceCheckUtils]: 1: Hoare triple {259#(< proc_i 985)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {255#(< proc_i 989)} is VALID [2018-12-17 14:30:17,913 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {259#(< proc_i 985)} is VALID [2018-12-17 14:30:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:17,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-17 14:30:17,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-17 14:30:17,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-17 14:30:17,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-17 14:30:17,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:30:17,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-12-17 14:30:17,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:30:17,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-17 14:30:17,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-17 14:30:17,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-17 14:30:17,938 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-17 14:30:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:17,965 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-17 14:30:17,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-17 14:30:17,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-17 14:30:17,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:30:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-17 14:30:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-17 14:30:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-17 14:30:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-17 14:30:17,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 9 transitions. [2018-12-17 14:30:17,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:30:17,975 INFO L225 Difference]: With dead ends: 9 [2018-12-17 14:30:17,976 INFO L226 Difference]: Without dead ends: 8 [2018-12-17 14:30:17,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-17 14:30:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-17 14:30:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-17 14:30:17,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:30:17,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2018-12-17 14:30:17,981 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-17 14:30:17,981 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-17 14:30:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:17,982 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-17 14:30:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-17 14:30:17,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:17,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:30:17,983 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-17 14:30:17,983 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-17 14:30:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:17,984 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-17 14:30:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-17 14:30:17,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:17,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:30:17,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:30:17,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:30:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-17 14:30:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-17 14:30:17,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-17 14:30:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:30:17,986 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-17 14:30:17,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-17 14:30:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-17 14:30:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-17 14:30:17,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:30:17,987 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-12-17 14:30:17,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:30:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:30:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727614, now seen corresponding path program 5 times [2018-12-17 14:30:17,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:30:17,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:30:17,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:30:17,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:30:17,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:30:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:18,118 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {309#(<= proc_i 0)} is VALID [2018-12-17 14:30:18,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#(<= proc_i 0)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {310#(<= proc_i 4)} is VALID [2018-12-17 14:30:18,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {310#(<= proc_i 4)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {311#(<= proc_i 8)} is VALID [2018-12-17 14:30:18,120 INFO L273 TraceCheckUtils]: 3: Hoare triple {311#(<= proc_i 8)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {312#(<= proc_i 12)} is VALID [2018-12-17 14:30:18,121 INFO L273 TraceCheckUtils]: 4: Hoare triple {312#(<= proc_i 12)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {313#(<= proc_i 16)} is VALID [2018-12-17 14:30:18,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {313#(<= proc_i 16)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {314#(<= proc_i 20)} is VALID [2018-12-17 14:30:18,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(<= proc_i 20)} assume !(i <= 1000); {308#false} is VALID [2018-12-17 14:30:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:30:18,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:30:18,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:30:18,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-17 14:30:18,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-17 14:30:18,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:30:18,125 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-17 14:30:18,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-17 14:30:18,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-17 14:30:18,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-17 14:30:18,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-17 14:30:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:30:18,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-17 14:30:18,364 INFO L683 Elim1Store]: detected equality via solver [2018-12-17 14:30:18,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-17 14:30:18,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-17 14:30:18,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-17 14:30:18,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-12-17 14:30:18,404 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {307#true} is VALID [2018-12-17 14:30:18,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#true} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} is VALID [2018-12-17 14:30:18,406 INFO L273 TraceCheckUtils]: 2: Hoare triple {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} is VALID [2018-12-17 14:30:18,406 INFO L273 TraceCheckUtils]: 3: Hoare triple {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} is VALID [2018-12-17 14:30:18,407 INFO L273 TraceCheckUtils]: 4: Hoare triple {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} is VALID [2018-12-17 14:30:18,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {321#(and (< 4 proc_j) (< proc_j 6) (<= (select proc_a 5) 1000))} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {334#(<= proc_i 999)} is VALID [2018-12-17 14:30:18,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#(<= proc_i 999)} assume !(i <= 1000); {308#false} is VALID [2018-12-17 14:30:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-17 14:30:18,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-17 14:30:18,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(<= proc_i 1000)} assume !(i <= 1000); {308#false} is VALID [2018-12-17 14:30:18,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {342#(< (select proc_a proc_j) 1002)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {338#(<= proc_i 1000)} is VALID [2018-12-17 14:30:18,454 INFO L273 TraceCheckUtils]: 4: Hoare triple {342#(< (select proc_a proc_j) 1002)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {342#(< (select proc_a proc_j) 1002)} is VALID [2018-12-17 14:30:18,454 INFO L273 TraceCheckUtils]: 3: Hoare triple {342#(< (select proc_a proc_j) 1002)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {342#(< (select proc_a proc_j) 1002)} is VALID [2018-12-17 14:30:18,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {342#(< (select proc_a proc_j) 1002)} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {342#(< (select proc_a proc_j) 1002)} is VALID [2018-12-17 14:30:18,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#true} assume i <= 1000;assume i + 4 < a[j];assume a[5] == 1000;assume j > 4;assume j < 6;i := i + 4; {342#(< (select proc_a proc_j) 1002)} is VALID [2018-12-17 14:30:18,456 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {307#true} is VALID [2018-12-17 14:30:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-17 14:30:18,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-17 14:30:18,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 11 [2018-12-17 14:30:18,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-17 14:30:18,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-17 14:30:18,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:30:18,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-12-17 14:30:18,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:30:18,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-17 14:30:18,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-17 14:30:18,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-12-17 14:30:18,488 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2018-12-17 14:30:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:18,676 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-17 14:30:18,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-17 14:30:18,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-17 14:30:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:30:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-17 14:30:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-17 14:30:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-17 14:30:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-17 14:30:18,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 10 transitions. [2018-12-17 14:30:18,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:30:18,691 INFO L225 Difference]: With dead ends: 9 [2018-12-17 14:30:18,691 INFO L226 Difference]: Without dead ends: 0 [2018-12-17 14:30:18,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2018-12-17 14:30:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-17 14:30:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-17 14:30:18,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:30:18,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-17 14:30:18,693 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-17 14:30:18,693 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-17 14:30:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:18,694 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-17 14:30:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-17 14:30:18,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:18,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:30:18,694 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-17 14:30:18,694 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-17 14:30:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:30:18,695 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-17 14:30:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-17 14:30:18,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:18,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:30:18,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:30:18,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:30:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-17 14:30:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-17 14:30:18,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-12-17 14:30:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:30:18,696 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-17 14:30:18,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-17 14:30:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-17 14:30:18,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:30:18,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-17 14:30:18,785 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 12 25) the Hoare annotation is: (or (and (< 4 proc_j) (< proc_j 6) (<= proc_i 999) (<= (select proc_a 5) 1000)) (<= proc_i 0)) [2018-12-17 14:30:18,785 INFO L448 ceAbstractionStarter]: For program point procErr0ASSERT_VIOLATIONASSERT(line 18) no Hoare annotation was computed. [2018-12-17 14:30:18,785 INFO L448 ceAbstractionStarter]: For program point procEXIT(lines 12 25) no Hoare annotation was computed. [2018-12-17 14:30:18,785 INFO L448 ceAbstractionStarter]: For program point procENTRY(lines 12 25) no Hoare annotation was computed. [2018-12-17 14:30:18,787 WARN L170 areAnnotationChecker]: procENTRY has no Hoare annotation [2018-12-17 14:30:18,787 WARN L170 areAnnotationChecker]: procErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-17 14:30:18,788 WARN L170 areAnnotationChecker]: procEXIT has no Hoare annotation [2018-12-17 14:30:18,788 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-17 14:30:18,793 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 02:30:18 BoogieIcfgContainer [2018-12-17 14:30:18,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-17 14:30:18,794 INFO L168 Benchmark]: Toolchain (without parser) took 21292.50 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 947.4 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -727.8 MB). Peak memory consumption was 219.6 MB. Max. memory is 7.1 GB. [2018-12-17 14:30:18,796 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:30:18,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:30:18,797 INFO L168 Benchmark]: Boogie Preprocessor took 22.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:30:18,797 INFO L168 Benchmark]: RCFGBuilder took 375.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-17 14:30:18,798 INFO L168 Benchmark]: TraceAbstraction took 20852.78 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 947.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.0 MB). Peak memory consumption was 198.4 MB. Max. memory is 7.1 GB. [2018-12-17 14:30:18,802 INFO L336 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 375.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20852.78 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 947.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.0 MB). Peak memory consumption was 198.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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: 12]: Loop Invariant Derived loop invariant: (((4 < j && j < 6) && i <= 999) && a[5] <= 1000) || i <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. SAFE Result, 20.7s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 1 SDslu, 2 SDs, 0 SdLazy, 40 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 17.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 7 NumberOfFragments, 19 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 52 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 SizeOfPredicates, 5 NumberOfNonLiveVariables, 121 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 22/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...