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/codeblockAssertOrder01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-4b9831f [2018-12-23 14:27:21,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-23 14:27:21,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-23 14:27:21,406 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-23 14:27:21,407 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-23 14:27:21,408 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-23 14:27:21,410 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-23 14:27:21,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-23 14:27:21,415 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-23 14:27:21,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-23 14:27:21,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-23 14:27:21,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-23 14:27:21,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-23 14:27:21,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-23 14:27:21,429 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-23 14:27:21,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-23 14:27:21,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-23 14:27:21,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-23 14:27:21,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-23 14:27:21,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-23 14:27:21,449 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-23 14:27:21,453 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-23 14:27:21,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-23 14:27:21,460 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-23 14:27:21,460 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-23 14:27:21,461 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-23 14:27:21,462 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-23 14:27:21,463 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-23 14:27:21,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-23 14:27:21,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-23 14:27:21,470 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-23 14:27:21,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-23 14:27:21,471 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-23 14:27:21,471 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-23 14:27:21,474 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-23 14:27:21,475 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-23 14:27:21,475 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-23 14:27:21,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-23 14:27:21,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-23 14:27:21,498 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-23 14:27:21,498 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-23 14:27:21,499 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-23 14:27:21,499 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-23 14:27:21,499 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-23 14:27:21,499 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-23 14:27:21,499 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-23 14:27:21,500 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-23 14:27:21,500 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-23 14:27:21,500 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-23 14:27:21,500 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-23 14:27:21,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-23 14:27:21,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-23 14:27:21,502 INFO L133 SettingsManager]: * Use SBE=true [2018-12-23 14:27:21,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-23 14:27:21,502 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-23 14:27:21,504 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-23 14:27:21,505 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-23 14:27:21,505 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-23 14:27:21,505 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-23 14:27:21,505 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-23 14:27:21,505 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-23 14:27:21,505 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-23 14:27:21,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-23 14:27:21,506 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-23 14:27:21,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-23 14:27:21,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-23 14:27:21,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-23 14:27:21,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-23 14:27:21,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-23 14:27:21,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-23 14:27:21,508 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-23 14:27:21,508 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-23 14:27:21,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-23 14:27:21,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-23 14:27:21,508 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-23 14:27:21,508 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-23 14:27:21,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-23 14:27:21,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-23 14:27:21,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-23 14:27:21,571 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-23 14:27:21,572 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-23 14:27:21,573 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl [2018-12-23 14:27:21,573 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl' [2018-12-23 14:27:21,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-23 14:27:21,616 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-23 14:27:21,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-23 14:27:21,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-23 14:27:21,617 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-23 14:27:21,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (1/1) ... [2018-12-23 14:27:21,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (1/1) ... [2018-12-23 14:27:21,657 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-23 14:27:21,657 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-23 14:27:21,657 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-23 14:27:21,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-23 14:27:21,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-23 14:27:21,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-23 14:27:21,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-23 14:27:21,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (1/1) ... [2018-12-23 14:27:21,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (1/1) ... [2018-12-23 14:27:21,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (1/1) ... [2018-12-23 14:27:21,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (1/1) ... [2018-12-23 14:27:21,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (1/1) ... [2018-12-23 14:27:21,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (1/1) ... [2018-12-23 14:27:21,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (1/1) ... [2018-12-23 14:27:21,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-23 14:27:21,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-23 14:27:21,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-23 14:27:21,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-23 14:27:21,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (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-23 14:27:21,788 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-23 14:27:21,788 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-23 14:27:22,092 INFO L272 CfgBuilder]: Using library mode [2018-12-23 14:27:22,092 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-23 14:27:22,093 INFO L202 PluginConnector]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:27:22 BoogieIcfgContainer [2018-12-23 14:27:22,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-23 14:27:22,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-23 14:27:22,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-23 14:27:22,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-23 14:27:22,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:27:21" (1/2) ... [2018-12-23 14:27:22,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78be9039 and model type codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:27:22, skipping insertion in model container [2018-12-23 14:27:22,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:27:22" (2/2) ... [2018-12-23 14:27:22,103 INFO L112 eAbstractionObserver]: Analyzing ICFG codeblockAssertOrder01.bpl [2018-12-23 14:27:22,115 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-23 14:27:22,129 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-23 14:27:22,149 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-23 14:27:22,197 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-23 14:27:22,197 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-23 14:27:22,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-23 14:27:22,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-23 14:27:22,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-23 14:27:22,198 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-23 14:27:22,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-23 14:27:22,200 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-23 14:27:22,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-23 14:27:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-23 14:27:22,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:27:22,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-23 14:27:22,245 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:27:22,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:27:22,252 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-23 14:27:22,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:27:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:27:22,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:27:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:27:22,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:27:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:27:22,539 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0; {11#(<= main_i 0)} is VALID [2018-12-23 14:27:22,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(<= main_i 0)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {10#false} is VALID [2018-12-23 14:27:22,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[q] == 5); {10#false} is VALID [2018-12-23 14:27:22,556 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-23 14:27:22,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:27:22,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-23 14:27:22,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:27:22,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-23 14:27:22,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:27:22,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-23 14:27:22,612 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-23 14:27:22,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-23 14:27:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-23 14:27:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:27:22,624 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-23 14:27:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:27:22,717 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-23 14:27:22,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-23 14:27:22,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-23 14:27:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:27:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:27:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-12-23 14:27:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:27:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-12-23 14:27:22,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2018-12-23 14:27:22,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:27:22,800 INFO L225 Difference]: With dead ends: 11 [2018-12-23 14:27:22,801 INFO L226 Difference]: Without dead ends: 5 [2018-12-23 14:27:22,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:27:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-23 14:27:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-23 14:27:22,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:27:22,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2018-12-23 14:27:22,857 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-23 14:27:22,858 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-23 14:27:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:27:22,859 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-23 14:27:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-23 14:27:22,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:27:22,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:27:22,860 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-23 14:27:22,860 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-23 14:27:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:27:22,862 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-23 14:27:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-23 14:27:22,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:27:22,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:27:22,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:27:22,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:27:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-23 14:27:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-23 14:27:22,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-23 14:27:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:27:22,867 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-23 14:27:22,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-23 14:27:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-23 14:27:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-23 14:27:22,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:27:22,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-23 14:27:22,868 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:27:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:27:22,869 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-12-23 14:27:22,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:27:22,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:27:22,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:27:22,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:27:22,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:27:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:27:23,029 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0; {46#(<= main_i 0)} is VALID [2018-12-23 14:27:23,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#(<= main_i 0)} assume i <= 1000;i := i + 1; {47#(<= main_i 1)} is VALID [2018-12-23 14:27:23,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(<= main_i 1)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {45#false} is VALID [2018-12-23 14:27:23,032 INFO L273 TraceCheckUtils]: 3: Hoare triple {45#false} assume !(a[q] == 5); {45#false} is VALID [2018-12-23 14:27:23,032 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-23 14:27:23,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:27:23,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:27:23,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-23 14:27:23,036 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2018-12-23 14:27:23,101 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-23 14:27:23,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-23 14:27:26,339 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-23 14:27:26,341 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 1 different actions 12 times. Widened at 1 different actions 8 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-23 14:27:26,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:27:26,347 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-23 14:27:27,401 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 50% of their original sizes. [2018-12-23 14:27:27,430 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-23 14:27:29,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_115 Int) (v_idx_116 Int) (v_idx_117 Int)) (exists ((v_v_424_1 Int) (v_v_425_1 Int) (v_b_48_1 Int) (v_b_49_1 Int) (v_v_426_1 Int)) (let ((.cse0 (* 2 v_b_48_1)) (.cse7 (+ v_v_425_1 v_b_48_1)) (.cse10 (* 2 v_b_49_1)) (.cse11 (* 2 c_main_q)) (.cse2 (+ v_v_425_1 37)) (.cse9 (+ v_b_48_1 v_b_49_1)) (.cse6 (+ v_v_425_1 v_b_49_1)) (.cse5 (* 2 v_v_425_1)) (.cse13 (+ v_b_49_1 c_main_q)) (.cse12 (+ v_b_48_1 c_main_q)) (.cse4 (+ v_b_48_1 1)) (.cse1 (+ v_v_425_1 c_main_q)) (.cse3 (+ v_v_425_1 38)) (.cse8 (+ c_main_q 1))) (and (<= .cse0 84) (<= .cse1 47) (<= c_main_q .cse2) (<= .cse3 v_b_49_1) (<= .cse4 v_b_49_1) (<= 84 .cse0) (or (= (select c_main_a v_idx_115) v_v_424_1) (<= v_b_48_1 v_idx_115)) (<= v_b_48_1 .cse2) (<= 10 .cse5) (<= .cse6 48) (<= 47 .cse7) (<= v_b_49_1 .cse8) (<= v_b_48_1 c_main_q) (<= .cse2 v_b_48_1) (<= .cse9 85) (<= 86 .cse10) (<= .cse7 47) (<= .cse11 84) (<= c_main_q v_b_48_1) (<= .cse10 86) (<= 84 .cse11) (<= .cse2 c_main_q) (<= .cse12 84) (or (<= v_b_49_1 v_idx_116) (< v_idx_116 v_b_48_1) (= (select c_main_a v_idx_116) v_v_425_1)) (<= 85 .cse9) (<= 48 .cse6) (<= .cse5 10) (<= .cse13 85) (<= 85 .cse13) (<= 84 .cse12) (<= v_b_49_1 .cse4) (or (= v_v_426_1 (select c_main_a v_idx_117)) (< v_idx_117 v_b_49_1)) (<= 47 .cse1) (<= v_b_49_1 .cse3) (<= .cse8 v_b_49_1))))) is different from false [2018-12-23 14:27:29,718 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2018-12-23 14:27:30,005 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-23 14:27:30,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-23 14:27:30,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2018-12-23 14:27:30,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:27:30,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-23 14:27:30,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:27:30,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-23 14:27:30,023 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-23 14:27:30,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-23 14:27:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-23 14:27:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2018-12-23 14:27:30,025 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-23 14:27:30,042 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:27:30,043 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:27:30,043 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:27:30,045 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:27:30,045 WARN L224 ngHoareTripleChecker]: Pre: {86#(forall ((v_idx_136 Int)) (exists ((v_v_476_1 Int)) (and (<= (- (- c_main_i) c_main_i) 0) (= v_v_476_1 (select c_main_a v_idx_136)))))} [2018-12-23 14:27:30,045 WARN L228 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2018-12-23 14:27:30,047 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2018-12-23 14:27:30,047 WARN L230 ngHoareTripleChecker]: Post: {87#false} [2018-12-23 14:27:30,048 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:27:30,049 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:27:30,049 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:27:30,080 WARN L270 ngHoareTripleChecker]: Pre: {86#(<= (- (- main_i) main_i) 0)} [2018-12-23 14:27:30,081 WARN L274 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2018-12-23 14:27:30,082 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2018-12-23 14:27:30,122 WARN L276 ngHoareTripleChecker]: Post: {87#false} [2018-12-23 14:27:30,123 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:27:30,124 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:27:30,124 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[main_a] -> [-inf_0] v_476 [inf_0], }, Substate: {ints: {main_i = [0; inf]}, 4 vars top, }}} [2018-12-23 14:27:30,125 WARN L628 ntHoareTripleChecker]: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) (assume i <= 1000;i := i + 1;) [2018-12-23 14:27:30,125 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2018-12-23 14:27:30,126 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:27:30,331 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:27:30,332 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:27:30,332 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:27:30,332 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:27:30,333 WARN L224 ngHoareTripleChecker]: Pre: {88#(forall ((v_idx_145 Int)) (exists ((v_v_477_1 Int)) (and (= (select c_main_a v_idx_145) v_v_477_1) (<= (- (- c_main_i) c_main_i) 0))))} [2018-12-23 14:27:30,333 WARN L228 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2018-12-23 14:27:30,333 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2018-12-23 14:27:30,333 WARN L230 ngHoareTripleChecker]: Post: {89#(forall ((v_idx_148 Int) (v_idx_146 Int) (v_idx_147 Int)) (exists ((v_v_424_1 Int) (v_v_425_1 Int) (v_b_48_1 Int) (v_b_49_1 Int) (v_v_426_1 Int)) (and (<= (- (- v_b_48_1) c_main_q) (- 84)) (<= (- (- v_b_48_1) v_v_425_1) (- 47)) (or (< v_idx_148 v_b_49_1) (= v_v_426_1 (select c_main_a v_idx_148))) (<= (- (- v_b_49_1) v_v_425_1) (- 48)) (<= (- (- v_v_425_1) v_v_425_1) (- 10)) (<= (- v_b_48_1 v_b_49_1) (- 1)) (<= (- (- c_main_q) c_main_q) (- 84)) (<= (- (- v_b_48_1) v_b_49_1) (- 85)) (<= (- v_b_48_1 c_main_q) 0) (<= (- (- c_main_q) (- v_v_425_1)) (- 37)) (<= (- v_b_48_1 v_v_425_1) 37) (<= (- v_v_425_1 (- v_v_425_1)) 10) (<= (- (- v_b_48_1) (- v_b_49_1)) 1) (<= (- (- v_b_49_1) c_main_q) (- 85)) (<= (- (- c_main_q) v_v_425_1) (- 47)) (<= (- v_b_48_1 (- v_v_425_1)) 47) (<= (- c_main_q (- c_main_q)) 84) (<= (- (- v_b_48_1) (- v_v_425_1)) (- 37)) (<= (- v_b_49_1 (- v_b_49_1)) 86) (<= (- (- v_b_49_1) v_b_49_1) (- 86)) (<= (- v_b_48_1 (- v_b_48_1)) 84) (<= (- v_b_49_1 v_v_425_1) 38) (<= (- c_main_q v_v_425_1) 37) (<= (- v_b_48_1 (- v_b_49_1)) 85) (<= (- v_b_48_1 (- c_main_q)) 84) (<= (- v_b_49_1 (- c_main_q)) 85) (<= (- (- v_b_48_1) v_b_48_1) (- 84)) (<= (- (- v_b_48_1) (- c_main_q)) 0) (<= (- v_b_49_1 (- v_v_425_1)) 48) (or (<= v_b_48_1 v_idx_146) (= (select c_main_a v_idx_146) v_v_424_1)) (<= (- v_b_49_1 c_main_q) 1) (<= (- (- v_b_49_1) (- c_main_q)) (- 1)) (<= (- (- v_b_49_1) (- v_v_425_1)) (- 38)) (or (= v_v_425_1 (select c_main_a v_idx_147)) (<= v_b_49_1 v_idx_147) (< v_idx_147 v_b_48_1)) (<= (- c_main_q (- v_v_425_1)) 47))))} [2018-12-23 14:27:30,334 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:27:30,335 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:27:30,335 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:27:30,347 WARN L270 ngHoareTripleChecker]: Pre: {88#(<= (- (- main_i) main_i) 0)} [2018-12-23 14:27:30,347 WARN L274 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2018-12-23 14:27:30,347 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000))