java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:36:47,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:36:47,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:36:47,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:36:47,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:36:47,509 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:36:47,510 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:36:47,512 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:36:47,514 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:36:47,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:36:47,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:36:47,516 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:36:47,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:36:47,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:36:47,519 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:36:47,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:36:47,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:36:47,523 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:36:47,525 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:36:47,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:36:47,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:36:47,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:36:47,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:36:47,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:36:47,533 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:36:47,535 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:36:47,536 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:36:47,537 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:36:47,538 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:36:47,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:36:47,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:36:47,542 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:36:47,542 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:36:47,542 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:36:47,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:36:47,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:36:47,548 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:36:47,574 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:36:47,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:36:47,575 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:36:47,576 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:36:47,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:36:47,576 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:36:47,576 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:36:47,577 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:36:47,577 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:36:47,577 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:36:47,577 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:36:47,577 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:36:47,578 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:36:47,579 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:36:47,579 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:36:47,579 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:36:47,580 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:36:47,581 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:36:47,581 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:36:47,582 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:36:47,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:36:47,582 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:36:47,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:36:47,583 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:36:47,583 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:36:47,583 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:36:47,583 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:36:47,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:36:47,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:36:47,584 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:36:47,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:47,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:36:47,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:36:47,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:36:47,586 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:36:47,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:36:47,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:36:47,586 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:36:47,586 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:36:47,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:36:47,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:36:47,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:36:47,642 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:36:47,643 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:36:47,643 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl [2019-02-25 15:36:47,644 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2019-02-25 15:36:47,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:36:47,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:36:47,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:47,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:36:47,695 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:36:47,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:47,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:36:47,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:36:47,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:36:47,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:36:47,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:36:47,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:36:47,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:36:47,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:47,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:36:47,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:36:48,189 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:36:48,190 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-25 15:36:48,191 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:48 BoogieIcfgContainer [2019-02-25 15:36:48,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:36:48,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:36:48,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:36:48,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:36:48,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/2) ... [2019-02-25 15:36:48,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f69474f and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:36:48, skipping insertion in model container [2019-02-25 15:36:48,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:48" (2/2) ... [2019-02-25 15:36:48,200 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2019-02-25 15:36:48,213 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:36:48,224 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:36:48,244 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:36:48,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:36:48,279 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:36:48,279 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:36:48,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:36:48,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:36:48,280 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:36:48,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:36:48,280 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:36:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-25 15:36:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:36:48,303 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:48,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:36:48,307 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 28790350, now seen corresponding path program 1 times [2019-02-25 15:36:48,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:48,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:36:48,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:36:48,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:36:48,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:36:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:36:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:36:48,624 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-02-25 15:36:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:48,784 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-02-25 15:36:48,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:36:48,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:36:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:48,797 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:36:48,797 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:36:48,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:36:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:36:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-02-25 15:36:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-25 15:36:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-02-25 15:36:48,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-02-25 15:36:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:48,839 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-02-25 15:36:48,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:36:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-02-25 15:36:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:36:48,840 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:48,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:36:48,840 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:48,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:48,841 INFO L82 PathProgramCache]: Analyzing trace with hash 892498710, now seen corresponding path program 1 times [2019-02-25 15:36:48,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:48,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:48,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:48,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:48,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:48,985 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:36:48,988 INFO L207 CegarAbsIntRunner]: [0], [5], [12], [20], [22], [30] [2019-02-25 15:36:49,088 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:36:49,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:41:35,825 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:41:35,828 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Never found a fixpoint. Largest state had 0 variables. [2019-02-25 15:41:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:35,833 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:41:41,514 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 25% of their original sizes. [2019-02-25 15:41:41,514 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:41:44,834 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_192 Int) (v_idx_223 Int) (v_idx_184 Int) (v_idx_185 Int) (v_idx_182 Int) (v_idx_183 Int) (v_idx_221 Int) (v_idx_188 Int) (v_idx_222 Int) (v_idx_189 Int) (v_idx_186 Int) (v_idx_220 Int) (v_idx_187 Int) (v_idx_180 Int) (v_idx_181 Int) (v_idx_214 Int) (v_idx_215 Int) (v_idx_179 Int) (v_idx_212 Int) (v_idx_213 Int) (v_idx_218 Int) (v_idx_219 Int) (v_idx_216 Int) (v_idx_217 Int) (v_idx_173 Int) (v_idx_174 Int) (v_idx_171 Int) (v_idx_172 Int) (v_idx_177 Int) (v_idx_210 Int) (v_idx_178 Int) (v_idx_211 Int) (v_idx_175 Int) (v_idx_176 Int) (v_idx_170 Int) (v_idx_209 Int) (v_idx_203 Int) (v_idx_204 Int) (v_idx_201 Int) (v_idx_202 Int) (v_idx_208 Int) (v_idx_205 Int) (v_idx_200 Int) (v_idx_195 Int) (v_idx_196 Int) (v_idx_193 Int) (v_idx_194 Int) (v_idx_199 Int) (v_idx_197 Int) (v_idx_198 Int)) (let ((.cse5 (* 2 c_ULTIMATE.start_main_~i~4)) (.cse10 (+ c_ULTIMATE.start_main_~i~4 18)) (.cse9 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~i~4)) (.cse0 (+ c_ULTIMATE.start_main_~nodecount~4 15)) (.cse1 (+ c_ULTIMATE.start_main_~i~4 17)) (.cse2 (+ c_ULTIMATE.start_main_~i~4 16)) (.cse15 (* 2 c_ULTIMATE.start_main_~edgecount~4)) (.cse7 (+ c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse14 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse11 (+ c_ULTIMATE.start_main_~i~4 3)) (.cse3 (+ c_ULTIMATE.start_main_~nodecount~4 14)) (.cse6 (* 2 c_ULTIMATE.start_main_~nodecount~4)) (.cse8 (+ c_ULTIMATE.start_main_~i~4 20)) (.cse13 (+ c_ULTIMATE.start_main_~nodecount~4 8)) (.cse4 (+ c_ULTIMATE.start_main_~i~4 4)) (.cse12 (+ c_ULTIMATE.start_main_~i~4 5))) (and (<= .cse0 c_ULTIMATE.start_main_~edgecount~4) (or (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_220) 3) c_ULTIMATE.start_main_~nodecount~4) (<= .cse1 v_idx_220) (< v_idx_220 .cse2)) (or (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_204) 3) c_ULTIMATE.start_main_~nodecount~4) (< v_idx_204 .cse1) (<= .cse3 v_idx_204)) (or (= .cse4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_223)) (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_223) (< v_idx_223 .cse3)) (or (= 34 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_184) c_ULTIMATE.start_main_~edgecount~4)) (< (+ v_idx_184 c_ULTIMATE.start_main_~edgecount~4) 34) (<= 15 (+ c_ULTIMATE.start_main_~i~4 v_idx_184))) (<= 0 .cse5) (<= .cse5 0) (<= .cse6 10) (or (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_198) 13) (= .cse4 (select c_ULTIMATE.start_main_~Source~4 v_idx_198)) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_198 10))) (or (< v_idx_179 9) (= 9 (select c_ULTIMATE.start_main_~Weight~4 v_idx_179)) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_179 10))) (or (<= 25 (+ v_idx_174 c_ULTIMATE.start_main_~edgecount~4)) (= .cse4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_174)) (< v_idx_174 .cse4)) (<= .cse7 20) (or (< (+ v_idx_219 c_ULTIMATE.start_main_~i~4) 15) (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_219) 20)) (<= .cse2 v_idx_219)) (or (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_192) 20)) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_192 4)) (< (+ v_idx_192 20) c_ULTIMATE.start_main_~edgecount~4)) (or (< (+ v_idx_193 4) c_ULTIMATE.start_main_~nodecount~4) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_193 3)) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_193) .cse4)) (<= c_ULTIMATE.start_main_~edgecount~4 .cse8) (<= 20 c_ULTIMATE.start_main_~edgecount~4) (<= .cse9 5) (or (= .cse1 (select c_ULTIMATE.start_main_~Weight~4 v_idx_187)) (<= .cse10 v_idx_187) (< v_idx_187 .cse1)) (or (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_170) 20)) (< (+ v_idx_170 20) c_ULTIMATE.start_main_~edgecount~4) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_170 4))) (<= c_ULTIMATE.start_main_~nodecount~4 5) (or (<= 9 v_idx_178) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_178) 13) (= 13 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_178) c_ULTIMATE.start_main_~nodecount~4))) (or (<= .cse3 v_idx_222) (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_222) 20) c_ULTIMATE.start_main_~edgecount~4) (< v_idx_222 .cse10)) (or (< (+ v_idx_215 c_ULTIMATE.start_main_~nodecount~4) 13) (= .cse11 (select c_ULTIMATE.start_main_~Dest~4 v_idx_215)) (<= 9 v_idx_215)) (or (= .cse11 (select c_ULTIMATE.start_main_~Source~4 v_idx_202)) (< (+ v_idx_202 c_ULTIMATE.start_main_~i~4) 15) (<= .cse2 v_idx_202)) (or (<= 13 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_177)) (= 27 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_177) c_ULTIMATE.start_main_~edgecount~4)) (< (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_177) 27)) (or (< v_idx_205 .cse3) (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_205) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_205) .cse11)) (or (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_185) c_ULTIMATE.start_main_~i~4) 15) (<= .cse2 v_idx_185) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_185) 15)) (<= .cse12 c_ULTIMATE.start_main_~nodecount~4) (or (< v_idx_173 .cse11) (<= .cse4 v_idx_173) (= .cse11 (select c_ULTIMATE.start_main_~Weight~4 v_idx_173))) (or (<= 13 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_197)) (= .cse11 (select c_ULTIMATE.start_main_~Source~4 v_idx_197)) (< (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_197) 27)) (<= 5 c_ULTIMATE.start_main_~nodecount~4) (or (<= .cse13 v_idx_216) (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_216) 20)) (< v_idx_216 9)) (or (<= .cse10 v_idx_221) (< v_idx_221 .cse1) (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_221) 4) c_ULTIMATE.start_main_~nodecount~4)) (or (<= .cse1 v_idx_186) (< v_idx_186 .cse2) (= .cse2 (select c_ULTIMATE.start_main_~Weight~4 v_idx_186))) (or (<= 27 (+ v_idx_213 c_ULTIMATE.start_main_~edgecount~4)) (= .cse11 (select c_ULTIMATE.start_main_~Dest~4 v_idx_213)) (< (+ v_idx_213 c_ULTIMATE.start_main_~nodecount~4) 11)) (<= .cse14 25) (or (< (+ v_idx_199 10) c_ULTIMATE.start_main_~edgecount~4) (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_199) 3) c_ULTIMATE.start_main_~nodecount~4) (<= 17 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_199))) (or (<= .cse3 v_idx_188) (< v_idx_188 .cse10) (= .cse10 (select c_ULTIMATE.start_main_~Weight~4 v_idx_188))) (or (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_175) c_ULTIMATE.start_main_~edgecount~4) 25) (< (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_175) 25) (<= 11 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_175))) (<= 5 .cse9) (or (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_208) 4) c_ULTIMATE.start_main_~nodecount~4) (< (+ v_idx_208 20) c_ULTIMATE.start_main_~edgecount~4) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_208 4))) (<= c_ULTIMATE.start_main_~edgecount~4 20) (<= c_ULTIMATE.start_main_~edgecount~4 .cse0) (or (< (+ v_idx_181 9) c_ULTIMATE.start_main_~edgecount~4) (<= 17 (+ v_idx_181 c_ULTIMATE.start_main_~nodecount~4)) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_181) 9) c_ULTIMATE.start_main_~edgecount~4)) (or (<= .cse13 v_idx_200) (= .cse11 (select c_ULTIMATE.start_main_~Source~4 v_idx_200)) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_200) 17)) (or (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_194) 4) c_ULTIMATE.start_main_~nodecount~4) (<= .cse4 v_idx_194) (< (+ v_idx_194 3) c_ULTIMATE.start_main_~nodecount~4)) (or (<= .cse1 v_idx_203) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_203) 4)) (< v_idx_203 .cse2)) (or (= .cse11 (select c_ULTIMATE.start_main_~Dest~4 v_idx_209)) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_209 3)) (< (+ v_idx_209 4) c_ULTIMATE.start_main_~nodecount~4)) (or (= .cse4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_210)) (< (+ v_idx_210 3) c_ULTIMATE.start_main_~nodecount~4) (<= .cse11 v_idx_210)) (<= 40 .cse15) (or (<= .cse13 v_idx_182) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_182) 17) (= 17 (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_182)))) (or (<= .cse11 v_idx_172) (< (+ v_idx_172 3) c_ULTIMATE.start_main_~nodecount~4) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_172) 3))) (or (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_180) 10)) (< (+ v_idx_180 10) c_ULTIMATE.start_main_~edgecount~4) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_180 9))) (or (< v_idx_211 .cse11) (<= 25 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_211)) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_211) 4))) (<= .cse15 40) (<= 20 .cse7) (or (< v_idx_217 .cse13) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_217) 3)) (<= 34 (+ v_idx_217 c_ULTIMATE.start_main_~edgecount~4))) (<= 25 .cse14) (or (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_196) 4) c_ULTIMATE.start_main_~nodecount~4) (<= 27 (+ v_idx_196 c_ULTIMATE.start_main_~edgecount~4)) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_196) 11)) (or (= (select c_ULTIMATE.start_main_~Weight~4 v_idx_183) .cse13) (< v_idx_183 .cse13) (<= 34 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_183))) (or (< (+ v_idx_218 c_ULTIMATE.start_main_~edgecount~4) 34) (= .cse11 (select c_ULTIMATE.start_main_~Dest~4 v_idx_218)) (<= 15 (+ v_idx_218 c_ULTIMATE.start_main_~i~4))) (<= 0 c_ULTIMATE.start_main_~i~4) (or (= (select c_ULTIMATE.start_main_~Weight~4 v_idx_189) .cse3) (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_189) (< v_idx_189 .cse3)) (or (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_171 3)) (< (+ v_idx_171 4) c_ULTIMATE.start_main_~nodecount~4) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_171) 4) c_ULTIMATE.start_main_~nodecount~4)) (<= 10 .cse6) (or (<= 11 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_195)) (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_195) 20)) (< v_idx_195 .cse4)) (or (<= 27 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_176)) (= 11 (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_176))) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_176) 11)) (<= c_ULTIMATE.start_main_~i~4 0) (<= .cse8 c_ULTIMATE.start_main_~edgecount~4) (or (= .cse4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_214)) (<= 13 (+ v_idx_214 c_ULTIMATE.start_main_~nodecount~4)) (< (+ v_idx_214 c_ULTIMATE.start_main_~edgecount~4) 27)) (or (< v_idx_201 .cse13) (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_201) 20) c_ULTIMATE.start_main_~edgecount~4) (<= 15 (+ v_idx_201 c_ULTIMATE.start_main_~i~4))) (or (<= 11 (+ v_idx_212 c_ULTIMATE.start_main_~nodecount~4)) (= .cse4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_212)) (< (+ v_idx_212 c_ULTIMATE.start_main_~edgecount~4) 25)) (<= c_ULTIMATE.start_main_~nodecount~4 .cse12)))) is different from false [2019-02-25 15:41:44,862 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-02-25 15:41:44,862 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:41:44,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:41:44,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-02-25 15:41:44,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:41:44,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:41:44,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:41:44,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-02-25 15:41:44,866 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2019-02-25 15:50:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:49,446 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2019-02-25 15:50:49,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:50:49,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-02-25 15:50:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:49,447 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:50:49,447 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:50:49,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-02-25 15:50:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:50:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-25 15:50:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:50:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-02-25 15:50:49,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 6 [2019-02-25 15:50:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:49,454 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-02-25 15:50:49,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:50:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-02-25 15:50:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:50:49,455 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:49,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:50:49,455 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1948209421, now seen corresponding path program 1 times [2019-02-25 15:50:49,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:49,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:50:49,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:50:49,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:50:49,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:50:49,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:50:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:50:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:50:49,603 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2019-02-25 15:50:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:49,608 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-02-25 15:50:49,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:50:49,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-02-25 15:50:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:49,609 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:50:49,609 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 15:50:49,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:50:49,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 15:50:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 15:50:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 15:50:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 15:50:49,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-02-25 15:50:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:49,611 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 15:50:49,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:50:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 15:50:49,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 15:50:49,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.