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_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:31:18,773 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:31:18,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:31:18,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:31:18,792 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:31:18,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:31:18,795 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:31:18,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:31:18,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:31:18,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:31:18,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:31:18,808 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:31:18,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:31:18,811 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:31:18,814 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:31:18,815 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:31:18,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:31:18,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:31:18,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:31:18,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:31:18,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:31:18,839 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:31:18,841 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:31:18,841 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:31:18,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:31:18,845 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:31:18,848 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:31:18,849 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:31:18,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:31:18,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:31:18,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:31:18,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:31:18,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:31:18,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:31:18,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:31:18,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:31:18,856 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 14:31:18,877 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:31:18,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:31:18,878 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:31:18,878 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:31:18,879 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:31:18,879 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:31:18,879 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:31:18,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:31:18,880 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:31:18,880 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:31:18,880 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:31:18,880 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:31:18,880 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:31:18,881 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:31:18,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:31:18,882 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:31:18,882 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:31:18,882 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:31:18,883 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:31:18,883 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:31:18,883 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:31:18,883 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:31:18,883 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:31:18,884 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:31:18,884 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:31:18,884 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:31:18,884 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:31:18,884 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:31:18,884 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:31:18,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:31:18,886 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:31:18,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:18,886 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:31:18,886 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:31:18,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:31:18,887 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:31:18,887 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:31:18,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:31:18,887 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:31:18,888 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:31:18,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:31:18,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:31:18,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:31:18,945 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:31:18,945 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:31:18,946 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2019-01-31 14:31:18,946 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-01-31 14:31:18,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:31:18,991 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:31:18,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:18,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:31:18,992 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:31:19,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (1/1) ... [2019-01-31 14:31:19,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (1/1) ... [2019-01-31 14:31:19,026 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 14:31:19,027 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 14:31:19,027 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 14:31:19,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:19,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:31:19,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:31:19,030 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:31:19,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (1/1) ... [2019-01-31 14:31:19,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (1/1) ... [2019-01-31 14:31:19,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (1/1) ... [2019-01-31 14:31:19,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (1/1) ... [2019-01-31 14:31:19,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (1/1) ... [2019-01-31 14:31:19,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (1/1) ... [2019-01-31 14:31:19,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (1/1) ... [2019-01-31 14:31:19,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:31:19,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:31:19,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:31:19,057 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:31:19,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-01-31 14:31:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-01-31 14:31:19,375 INFO L278 CfgBuilder]: Using library mode [2019-01-31 14:31:19,375 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-31 14:31:19,376 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:19 BoogieIcfgContainer [2019-01-31 14:31:19,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:31:19,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:31:19,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:31:19,382 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:31:19,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:18" (1/2) ... [2019-01-31 14:31:19,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748520e8 and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:31:19, skipping insertion in model container [2019-01-31 14:31:19,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:19" (2/2) ... [2019-01-31 14:31:19,387 INFO L112 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2019-01-31 14:31:19,397 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:31:19,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:31:19,424 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:31:19,463 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:31:19,463 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:31:19,463 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:31:19,463 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:31:19,463 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:31:19,463 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:31:19,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:31:19,464 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:31:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-01-31 14:31:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 14:31:19,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:19,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 14:31:19,502 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:19,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-01-31 14:31:19,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:19,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:19,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:19,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:19,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:19,725 INFO L273 TraceCheckUtils]: 0: Hoare triple {7#true} i := 0; {9#(<= proc_i 0)} is VALID [2019-01-31 14:31:19,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {9#(<= proc_i 0)} assume !(i <= 1000); {8#false} is VALID [2019-01-31 14:31:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:19,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:19,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 14:31:19,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:19,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:31:19,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:19,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:31:19,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:19,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:31:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:31:19,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:19,809 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-01-31 14:31:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:19,928 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 14:31:19,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:19,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:31:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-31 14:31:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-31 14:31:19,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-01-31 14:31:19,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:19,998 INFO L225 Difference]: With dead ends: 7 [2019-01-31 14:31:19,998 INFO L226 Difference]: Without dead ends: 4 [2019-01-31 14:31:20,001 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 [2019-01-31 14:31:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-01-31 14:31:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-01-31 14:31:20,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:20,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4 states. Second operand 4 states. [2019-01-31 14:31:20,040 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-01-31 14:31:20,040 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-01-31 14:31:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:20,041 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-01-31 14:31:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-31 14:31:20,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:20,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:20,044 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-01-31 14:31:20,044 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-01-31 14:31:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:20,046 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-01-31 14:31:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-31 14:31:20,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:20,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:20,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:20,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-31 14:31:20,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-01-31 14:31:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:20,052 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-01-31 14:31:20,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-31 14:31:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:31:20,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:20,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:31:20,053 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:20,054 INFO L82 PathProgramCache]: Analyzing trace with hash 29950, now seen corresponding path program 1 times [2019-01-31 14:31:20,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:20,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:20,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:20,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:20,151 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {37#(<= proc_i 0)} is VALID [2019-01-31 14:31:20,162 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 [2019-01-31 14:31:20,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#(<= proc_i 4)} assume !(i <= 1000); {36#false} is VALID [2019-01-31 14:31:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:20,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:20,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:20,179 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 14:31:20,181 INFO L207 CegarAbsIntRunner]: [0], [4], [5] [2019-01-31 14:31:20,216 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:20,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:20,444 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:31:20,446 INFO L272 AbstractInterpreter]: Visited 3 different actions 9 times. Merged at 1 different actions 3 times. Never widened. Performed 95 root evaluator evaluations with a maximum evaluation depth of 2. Performed 95 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 14:31:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:20,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:31:20,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:20,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 14:31:20,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:20,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:20,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:20,697 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {37#(<= proc_i 0)} is VALID [2019-01-31 14:31:20,711 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 [2019-01-31 14:31:20,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#(<= proc_i 4)} assume !(i <= 1000); {36#false} is VALID [2019-01-31 14:31:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:20,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:21,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= proc_i 1000)} assume !(i <= 1000); {36#false} is VALID [2019-01-31 14:31:21,098 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 [2019-01-31 14:31:21,111 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} i := 0; {52#(< proc_i 997)} is VALID [2019-01-31 14:31:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:21,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:21,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2019-01-31 14:31:21,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:21,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:21,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:21,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:21,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:21,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:21,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:21,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 14:31:21,152 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-01-31 14:31:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:21,212 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 14:31:21,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:21,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 14:31:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-31 14:31:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-31 14:31:21,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 6 transitions. [2019-01-31 14:31:21,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:21,231 INFO L225 Difference]: With dead ends: 6 [2019-01-31 14:31:21,231 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 14:31:21,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 14:31:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 14:31:21,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 14:31:21,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:21,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:21,261 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:21,261 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:21,262 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 14:31:21,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:21,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:21,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:21,263 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:21,263 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:21,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:21,265 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 14:31:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:21,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:21,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:21,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:21,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 14:31:21,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 14:31:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:21,269 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 14:31:21,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:31:21,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:21,269 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-31 14:31:21,270 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:21,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:21,270 INFO L82 PathProgramCache]: Analyzing trace with hash 928485, now seen corresponding path program 2 times [2019-01-31 14:31:21,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:21,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:21,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:21,379 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {84#(<= proc_i 0)} is VALID [2019-01-31 14:31:21,385 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 [2019-01-31 14:31:21,389 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 [2019-01-31 14:31:21,390 INFO L273 TraceCheckUtils]: 3: Hoare triple {86#(<= proc_i 8)} assume !(i <= 1000); {83#false} is VALID [2019-01-31 14:31:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:21,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:21,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:21,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:21,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:21,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:21,391 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 [2019-01-31 14:31:21,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 14:31:21,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 14:31:21,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 14:31:21,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:21,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:21,466 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {84#(<= proc_i 0)} is VALID [2019-01-31 14:31:21,468 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 [2019-01-31 14:31:21,469 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 [2019-01-31 14:31:21,486 INFO L273 TraceCheckUtils]: 3: Hoare triple {86#(<= proc_i 8)} assume !(i <= 1000); {83#false} is VALID [2019-01-31 14:31:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:21,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:21,678 INFO L273 TraceCheckUtils]: 3: Hoare triple {99#(<= proc_i 1000)} assume !(i <= 1000); {83#false} is VALID [2019-01-31 14:31:21,679 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 [2019-01-31 14:31:21,681 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 [2019-01-31 14:31:21,682 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} i := 0; {107#(< proc_i 993)} is VALID [2019-01-31 14:31:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:21,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:21,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-01-31 14:31:21,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:21,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-31 14:31:21,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:21,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-31 14:31:21,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:21,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 14:31:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 14:31:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 14:31:21,712 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-01-31 14:31:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:21,834 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 14:31:21,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 14:31:21,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-31 14:31:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-31 14:31:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-31 14:31:21,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 7 transitions. [2019-01-31 14:31:21,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:21,889 INFO L225 Difference]: With dead ends: 7 [2019-01-31 14:31:21,889 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 14:31:21,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 14:31:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 14:31:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 14:31:21,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:21,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:21,897 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:21,897 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:21,898 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 14:31:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:31:21,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:21,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:21,899 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:21,899 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:21,900 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 14:31:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:31:21,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:21,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:21,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:21,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-31 14:31:21,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-31 14:31:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:21,903 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-31 14:31:21,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 14:31:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 14:31:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:31:21,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:21,903 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-01-31 14:31:21,904 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash 28783070, now seen corresponding path program 3 times [2019-01-31 14:31:21,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:21,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:21,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:31:21,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:21,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:22,213 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {145#(<= proc_i 0)} is VALID [2019-01-31 14:31:22,226 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 [2019-01-31 14:31:22,239 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 [2019-01-31 14:31:22,252 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 [2019-01-31 14:31:22,265 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#(<= proc_i 12)} assume !(i <= 1000); {144#false} is VALID [2019-01-31 14:31:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:22,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:22,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:22,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:22,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:22,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:22,267 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 [2019-01-31 14:31:22,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 14:31:22,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 14:31:22,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 14:31:22,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:22,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:22,374 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {145#(<= proc_i 0)} is VALID [2019-01-31 14:31:22,375 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 [2019-01-31 14:31:22,376 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 [2019-01-31 14:31:22,377 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 [2019-01-31 14:31:22,378 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#(<= proc_i 12)} assume !(i <= 1000); {144#false} is VALID [2019-01-31 14:31:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:22,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:22,532 INFO L273 TraceCheckUtils]: 4: Hoare triple {164#(<= proc_i 1000)} assume !(i <= 1000); {144#false} is VALID [2019-01-31 14:31:22,533 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 [2019-01-31 14:31:22,534 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 [2019-01-31 14:31:22,535 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 [2019-01-31 14:31:22,536 INFO L273 TraceCheckUtils]: 0: Hoare triple {143#true} i := 0; {176#(< proc_i 989)} is VALID [2019-01-31 14:31:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:22,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:22,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-01-31 14:31:22,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:22,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-31 14:31:22,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:22,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 14:31:22,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:22,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 14:31:22,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 14:31:22,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 14:31:22,568 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-01-31 14:31:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:22,616 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:31:22,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 14:31:22,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-31 14:31:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-31 14:31:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-01-31 14:31:22,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 8 transitions. [2019-01-31 14:31:22,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:22,630 INFO L225 Difference]: With dead ends: 8 [2019-01-31 14:31:22,630 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 14:31:22,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 14:31:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 14:31:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 14:31:22,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:22,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:22,650 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:22,650 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:22,651 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 14:31:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 14:31:22,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:22,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:22,652 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:22,652 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:22,653 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 14:31:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 14:31:22,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:22,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:22,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:22,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-31 14:31:22,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-31 14:31:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:22,655 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-31 14:31:22,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 14:31:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 14:31:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 14:31:22,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:22,656 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-01-31 14:31:22,656 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:22,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:22,657 INFO L82 PathProgramCache]: Analyzing trace with hash 892275205, now seen corresponding path program 4 times [2019-01-31 14:31:22,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:22,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:22,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:31:22,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:22,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:22,804 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {220#(<= proc_i 0)} is VALID [2019-01-31 14:31:22,806 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 [2019-01-31 14:31:22,807 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 [2019-01-31 14:31:22,808 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 [2019-01-31 14:31:22,809 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 [2019-01-31 14:31:22,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(<= proc_i 16)} assume !(i <= 1000); {219#false} is VALID [2019-01-31 14:31:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:22,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:22,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:22,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:22,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:22,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:22,814 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 [2019-01-31 14:31:22,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:22,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:22,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:22,917 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {220#(<= proc_i 0)} is VALID [2019-01-31 14:31:22,919 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 [2019-01-31 14:31:22,928 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 [2019-01-31 14:31:22,931 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 [2019-01-31 14:31:22,940 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 [2019-01-31 14:31:22,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(<= proc_i 16)} assume !(i <= 1000); {219#false} is VALID [2019-01-31 14:31:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:22,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:23,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {243#(<= proc_i 1000)} assume !(i <= 1000); {219#false} is VALID [2019-01-31 14:31:23,076 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 [2019-01-31 14:31:23,081 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 [2019-01-31 14:31:23,082 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 [2019-01-31 14:31:23,083 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 [2019-01-31 14:31:23,086 INFO L273 TraceCheckUtils]: 0: Hoare triple {218#true} i := 0; {259#(< proc_i 985)} is VALID [2019-01-31 14:31:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:23,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:23,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-01-31 14:31:23,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:23,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 14:31:23,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:23,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-31 14:31:23,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:23,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 14:31:23,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 14:31:23,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 14:31:23,115 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-01-31 14:31:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:23,181 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-31 14:31:23,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 14:31:23,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 14:31:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-31 14:31:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-31 14:31:23,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 9 transitions. [2019-01-31 14:31:23,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:23,198 INFO L225 Difference]: With dead ends: 9 [2019-01-31 14:31:23,198 INFO L226 Difference]: Without dead ends: 8 [2019-01-31 14:31:23,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 14:31:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-31 14:31:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-31 14:31:23,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:23,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-01-31 14:31:23,204 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-31 14:31:23,205 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-31 14:31:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:23,206 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:31:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:31:23,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:23,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:23,207 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-31 14:31:23,207 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-31 14:31:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:23,208 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 14:31:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:31:23,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:23,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:23,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:23,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:31:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-31 14:31:23,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-31 14:31:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:23,210 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-31 14:31:23,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 14:31:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 14:31:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 14:31:23,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:23,211 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-01-31 14:31:23,211 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727614, now seen corresponding path program 5 times [2019-01-31 14:31:23,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:23,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:23,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:23,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:23,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:23,326 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {309#(<= proc_i 0)} is VALID [2019-01-31 14:31:23,327 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 [2019-01-31 14:31:23,327 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 [2019-01-31 14:31:23,328 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 [2019-01-31 14:31:23,329 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 [2019-01-31 14:31:23,330 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 [2019-01-31 14:31:23,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(<= proc_i 20)} assume !(i <= 1000); {308#false} is VALID [2019-01-31 14:31:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:23,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:23,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:23,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:23,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:23,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:23,332 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 [2019-01-31 14:31:23,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 14:31:23,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 14:31:23,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 14:31:23,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:23,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:23,548 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 14:31:23,559 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 [2019-01-31 14:31:23,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:23,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:23,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-01-31 14:31:23,607 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {307#true} is VALID [2019-01-31 14:31:23,608 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 [2019-01-31 14:31:23,608 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 [2019-01-31 14:31:23,613 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 [2019-01-31 14:31:23,621 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 [2019-01-31 14:31:23,622 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 [2019-01-31 14:31:23,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#(<= proc_i 999)} assume !(i <= 1000); {308#false} is VALID [2019-01-31 14:31:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-31 14:31:23,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:23,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(<= proc_i 1000)} assume !(i <= 1000); {308#false} is VALID [2019-01-31 14:31:23,682 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 [2019-01-31 14:31:23,682 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 [2019-01-31 14:31:23,683 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 [2019-01-31 14:31:23,683 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 [2019-01-31 14:31:23,684 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 [2019-01-31 14:31:23,684 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} i := 0; {307#true} is VALID [2019-01-31 14:31:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-31 14:31:23,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:23,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 11 [2019-01-31 14:31:23,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:23,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 14:31:23,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:23,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-31 14:31:23,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:23,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 14:31:23,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 14:31:23,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-31 14:31:23,719 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2019-01-31 14:31:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:23,915 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-31 14:31:23,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 14:31:23,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 14:31:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 14:31:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-31 14:31:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 14:31:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-31 14:31:23,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 10 transitions. [2019-01-31 14:31:23,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:23,932 INFO L225 Difference]: With dead ends: 9 [2019-01-31 14:31:23,933 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 14:31:23,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-01-31 14:31:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 14:31:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 14:31:23,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:23,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:23,935 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:23,935 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:23,935 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:23,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:23,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:23,935 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:23,935 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:23,936 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:23,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:23,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:23,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:23,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 14:31:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 14:31:23,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-01-31 14:31:23,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:23,937 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 14:31:23,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 14:31:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:23,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:23,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 14:31:24,034 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)) [2019-01-31 14:31:24,034 INFO L448 ceAbstractionStarter]: For program point procEXIT(lines 12 25) no Hoare annotation was computed. [2019-01-31 14:31:24,034 INFO L448 ceAbstractionStarter]: For program point procENTRY(lines 12 25) no Hoare annotation was computed. [2019-01-31 14:31:24,034 INFO L448 ceAbstractionStarter]: For program point procErr0ASSERT_VIOLATIONASSERT(line 18) no Hoare annotation was computed. [2019-01-31 14:31:24,035 WARN L170 areAnnotationChecker]: procENTRY has no Hoare annotation [2019-01-31 14:31:24,036 WARN L170 areAnnotationChecker]: procErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-31 14:31:24,036 WARN L170 areAnnotationChecker]: procEXIT has no Hoare annotation [2019-01-31 14:31:24,037 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. [2019-01-31 14:31:24,042 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:24 BoogieIcfgContainer [2019-01-31 14:31:24,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:24,044 INFO L168 Benchmark]: Toolchain (without parser) took 5054.59 ms. Allocated memory was 139.5 MB in the beginning and 257.9 MB in the end (delta: 118.5 MB). Free memory was 104.7 MB in the beginning and 183.9 MB in the end (delta: -79.2 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:24,046 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory is still 105.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:24,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.43 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 102.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:24,048 INFO L168 Benchmark]: Boogie Preprocessor took 24.48 ms. Allocated memory is still 139.5 MB. Free memory was 102.7 MB in the beginning and 101.7 MB in the end (delta: 933.7 kB). Peak memory consumption was 933.7 kB. Max. memory is 7.1 GB. [2019-01-31 14:31:24,048 INFO L168 Benchmark]: RCFGBuilder took 322.40 ms. Allocated memory is still 139.5 MB. Free memory was 101.5 MB in the beginning and 92.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:24,049 INFO L168 Benchmark]: TraceAbstraction took 4665.17 ms. Allocated memory was 139.5 MB in the beginning and 257.9 MB in the end (delta: 118.5 MB). Free memory was 92.0 MB in the beginning and 183.9 MB in the end (delta: -91.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:24,053 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.17 ms. Allocated memory is still 139.5 MB. Free memory is still 105.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.43 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 102.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.48 ms. Allocated memory is still 139.5 MB. Free memory was 102.7 MB in the beginning and 101.7 MB in the end (delta: 933.7 kB). Peak memory consumption was 933.7 kB. Max. memory is 7.1 GB. * RCFGBuilder took 322.40 ms. Allocated memory is still 139.5 MB. Free memory was 101.5 MB in the beginning and 92.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4665.17 ms. Allocated memory was 139.5 MB in the beginning and 257.9 MB in the end (delta: 118.5 MB). Free memory was 92.0 MB in the beginning and 183.9 MB in the end (delta: -91.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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, 4.5s 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, 1.2s 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, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s 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.0s SatisfiabilityAnalysisTime, 2.7s 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...